perm filename W82.OUT[LET,JMC]1 blob
sn#651356 filedate 1982-04-01 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00251 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00018 00002
C00019 00003 ∂04-Jan-82 1411 JMC John romano
C00020 00004 ∂04-Jan-82 1602 JMC
C00021 00005 ∂04-Jan-82 2111 JMC
C00022 00006 ∂05-Jan-82 0003 JMC Note to Herb Caen
C00023 00007 ∂05-Jan-82 0012 JMC
C00024 00008 ∂05-Jan-82 0024 JMC Using your system at Stanford
C00026 00009 ∂05-Jan-82 1544 JMC
C00027 00010 ∂05-Jan-82 2211 JMC
C00028 00011 ∂05-Jan-82 2235 JMC
C00029 00012 ∂06-Jan-82 0057 JMC
C00030 00013 ∂06-Jan-82 0059 JMC
C00031 00014 ∂06-Jan-82 1101 JMC Competitive life
C00032 00015 ∂06-Jan-82 1114 JMC
C00033 00016 ∂06-Jan-82 1811 JMC
C00034 00017 ∂07-Jan-82 0039 JMC
C00035 00018 ∂07-Jan-82 0059 JMC computer use for CS258
C00036 00019 ∂07-Jan-82 1155 JMC life
C00037 00020 ∂07-Jan-82 1545 JMC admissions
C00038 00021 ∂07-Jan-82 1616 JMC
C00039 00022 ∂07-Jan-82 2112 JMC
C00040 00023 ∂08-Jan-82 0811 JMC
C00041 00024 ∂08-Jan-82 0848 JMC ekl problem
C00042 00025 ∂08-Jan-82 0914 JMC
C00043 00026 ∂08-Jan-82 1001 JMC
C00044 00027 ∂08-Jan-82 1421 JMC funds for computing
C00045 00028 ∂08-Jan-82 1546 JMC Computer accts
C00046 00029 ∂09-Jan-82 0019 JMC lispx inelegances
C00048 00030 ∂09-Jan-82 0020 JMC more on lispx
C00049 00031 ∂09-Jan-82 0126 JMC
C00050 00032 ∂09-Jan-82 0150 JMC more lispx
C00051 00033 ∂10-Jan-82 0044 JMC
C00052 00034 ∂10-Jan-82 0046 JMC
C00054 00035 ∂10-Jan-82 1735 JMC more flat
C00056 00036 ∂10-Jan-82 2333 JMC
C00057 00037 ∂11-Jan-82 1834 JMC
C00058 00038 ∂11-Jan-82 2328 JMC bug?
C00059 00039 ∂12-Jan-82 0008 JMC
C00060 00040 ∂12-Jan-82 0135 JMC
C00062 00041 ∂12-Jan-82 1602 JMC proposal
C00063 00042 ∂12-Jan-82 2134 JMC
C00064 00043 ∂12-Jan-82 2150 JMC
C00065 00044 ∂13-Jan-82 0259 JMC
C00066 00045 ∂13-Jan-82 0323 JMC lisp axioms
C00067 00046 ∂13-Jan-82 1051 JMC
C00068 00047 ∂13-Jan-82 1101 JMC
C00069 00048 ∂13-Jan-82 1142 JMC
C00070 00049 ∂13-Jan-82 1155 JMC
C00071 00050 ∂13-Jan-82 1327 JMC system
C00072 00051 ∂13-Jan-82 1417 JMC
C00073 00052 ∂13-Jan-82 1440 JMC
C00074 00053 ∂13-Jan-82 1853 JMC proof done but could be improved
C00075 00054 ∂13-Jan-82 2136 JMC new bug
C00077 00055 ∂13-Jan-82 2156 JMC more on bug
C00078 00056 ∂14-Jan-82 1950 JMC improved lname
C00079 00057 ∂16-Jan-82 1705 JMC
C00080 00058 ∂16-Jan-82 2026 JMC
C00081 00059 ∂17-Jan-82 2313 JMC your axioms
C00082 00060 ∂18-Jan-82 1056 JMC
C00083 00061 ∂18-Jan-82 1110 JMC
C00085 00062 ∂18-Jan-82 1341 JMC
C00086 00063 ∂18-Jan-82 1344 JMC
C00087 00064 ∂18-Jan-82 1647 JMC
C00088 00065 ∂18-Jan-82 2205 JMC
C00089 00066 ∂18-Jan-82 2332 JMC m and b
C00090 00067 ∂19-Jan-82 1252 JMC
C00091 00068 ∂19-Jan-82 1252 JMC
C00092 00069 A partial message was sent by mistake. Here's the whole message.
C00096 00070 ∂19-Jan-82 1551 JMC paper
C00097 00071 ∂19-Jan-82 1650 JMC
C00101 00072 ∂19-Jan-82 1654 JMC
C00102 00073 ∂20-Jan-82 1254 JMC organization meeting for Porto course
C00103 00074 ∂20-Jan-82 1357 JMC
C00104 00075 ∂20-Jan-82 1835 JMC
C00106 00076 ∂20-Jan-82 2036 JMC
C00107 00077 ∂21-Jan-82 0051 JMC Hurd title
C00108 00078 ∂21-Jan-82 2102 JMC
C00109 00079 ∂21-Jan-82 2318 JMC
C00110 00080 ∂22-Jan-82 2034 JMC
C00111 00081 ∂22-Jan-82 2322 JMC
C00112 00082 ∂23-Jan-82 0055 JMC Umnov and Roth
C00113 00083 ∂23-Jan-82 0125 JMC
C00114 00084 ∂23-Jan-82 1104 JMC
C00115 00085 ∂23-Jan-82 1801 JMC Gosper
C00116 00086 ∂23-Jan-82 1814 JMC running out of screeen while running out of E
C00118 00087 ∂23-Jan-82 2316 JMC improved string search
C00121 00088 ∂24-Jan-82 0006 JMC
C00122 00089 ∂24-Jan-82 0121 JMC flap about Soviet robotics visitor
C00123 00090 ∂24-Jan-82 1752 JMC
C00124 00091 ∂24-Jan-82 2333 JMC
C00144 00092 ∂25-Jan-82 0201 JMC
C00145 00093 ∂25-Jan-82 0548 JMC
C00146 00094 ∂25-Jan-82 2120 JMC
C00147 00095 ∂26-Jan-82 1034 JMC
C00148 00096 ∂26-Jan-82 1309 JMC
C00149 00097 ∂27-Jan-82 1521 JMC
C00150 00098 ∂27-Jan-82 1526 JMC
C00153 00099 ∂27-Jan-82 1816 JMC
C00154 00100 ∂29-Jan-82 1532 JMC
C00155 00101 ∂29-Jan-82 1533 JMC
C00156 00102 ∂29-Jan-82 1535 JMC
C00157 00103 ∂29-Jan-82 1536 JMC
C00158 00104 ∂29-Jan-82 1546 JMC
C00159 00105 ∂29-Jan-82 2144 JMC
C00160 00106 ∂29-Jan-82 2150 JMC report and next friday
C00161 00107 ∂29-Jan-82 2207 JMC
C00162 00108 ∂30-Jan-82 0032 JMC report to LLL
C00163 00109 ∂30-Jan-82 1711 JMC Antonio Porto
C00164 00110 ∂30-Jan-82 2040 JMC
C00165 00111 ∂30-Jan-82 2041 JMC
C00166 00112 ∂31-Jan-82 1146 JMC
C00167 00113 ∂31-Jan-82 1722 JMC
C00171 00114 ∂31-Jan-82 1724 JMC
C00175 00115 ∂31-Jan-82 1925 JMC
C00176 00116 ∂31-Jan-82 1952 JMC
C00177 00117 ∂01-Feb-82 2320 JMC
C00178 00118 ∂01-Feb-82 2322 JMC
C00184 00119 ∂01-Feb-82 2325 JMC
C00185 00120 ∂01-Feb-82 2329 JMC Tops-20 Prolog Tape
C00188 00121 ∂02-Feb-82 0036 JMC
C00189 00122 ∂02-Feb-82 0144 JMC
C00190 00123 ∂02-Feb-82 0149 JMC
C00191 00124 ∂02-Feb-82 1020 JMC
C00192 00125 ∂02-Feb-82 1048 JMC
C00193 00126 ∂02-Feb-82 1620 JMC
C00194 00127 ∂02-Feb-82 1717 JMC
C00195 00128 ∂02-Feb-82 1753 JMC
C00196 00129 ∂02-Feb-82 1755 JMC
C00197 00130 ∂02-Feb-82 1841 JMC
C00198 00131 ∂02-Feb-82 2054 JMC
C00199 00132 ∂02-Feb-82 2056 JMC
C00200 00133 ∂03-Feb-82 1845 JMC sign
C00201 00134 ∂03-Feb-82 2335 JMC
C00206 00135 ∂03-Feb-82 2355 JMC
C00207 00136 ∂04-Feb-82 0157 JMC
C00208 00137 ∂04-Feb-82 1025 JMC
C00209 00138 ∂04-Feb-82 1032 JMC
C00210 00139 ∂04-Feb-82 1511 JMC
C00212 00140 ∂04-Feb-82 1624 JMC
C00213 00141 ∂04-Feb-82 2325 JMC
C00214 00142 ∂05-Feb-82 0036 JMC
C00215 00143 ∂05-Feb-82 0959 JMC
C00216 00144 ∂05-Feb-82 1719 JMC
C00217 00145 ∂06-Feb-82 2340 JMC
C00218 00146 ∂07-Feb-82 0223 JMC
C00219 00147 ∂07-Feb-82 1047 JMC
C00220 00148 ∂07-Feb-82 2302 JMC
C00221 00149 ∂08-Feb-82 0111 JMC
C00222 00150 ∂09-Feb-82 0404 JMC
C00223 00151 ∂09-Feb-82 0404 JMC account for Herbert Stoyan
C00224 00152 ∂09-Feb-82 0407 JMC
C00225 00153 ∂09-Feb-82 0408 JMC Stoyan account
C00226 00154 ∂09-Feb-82 0410 JMC
C00227 00155 ∂09-Feb-82 0944 JMC
C00228 00156 ∂09-Feb-82 1149 JMC
C00229 00157 ∂09-Feb-82 1150 JMC consulting bill
C00230 00158 ∂10-Feb-82 2345 JMC
C00231 00159 ∂11-Feb-82 1512 JMC
C00232 00160 ∂11-Feb-82 1704 JMC
C00233 00161 ∂12-Feb-82 1327 JMC
C00234 00162 ∂12-Feb-82 1455 JMC guest account for Martin Davis
C00235 00163 ∂12-Feb-82 1457 JMC account
C00236 00164 ∂12-Feb-82 2001 JMC message files
C00237 00165 ∂14-Feb-82 0119 JMC
C00238 00166 ∂14-Feb-82 1326 JMC
C00239 00167 ∂14-Feb-82 1328 JMC
C00240 00168 ∂14-Feb-82 1344 JMC
C00241 00169 ∂14-Feb-82 1659 JMC
C00242 00170 ∂14-Feb-82 2039 JMC
C00243 00171 ∂14-Feb-82 2055 JMC
C00244 00172 ∂14-Feb-82 2150 JMC
C00245 00173 ∂15-Feb-82 0128 JMC
C00246 00174 ∂15-Feb-82 1351 JMC
C00247 00175 ∂16-Feb-82 1128 JMC Davis address
C00248 00176 ∂16-Feb-82 2118 JMC
C00249 00177 ∂17-Feb-82 0047 JMC
C00250 00178 ∂17-Feb-82 0103 JMC
C00251 00179 ∂17-Feb-82 0138 JMC
C00252 00180 ∂17-Feb-82 0145 JMC
C00253 00181 ∂17-Feb-82 0149 JMC
C00254 00182 ∂17-Feb-82 0155 JMC
C00255 00183 ∂17-Feb-82 0241 JMC
C00256 00184 ∂17-Feb-82 0307 JMC
C00257 00185 ∂17-Feb-82 0312 JMC
C00258 00186 ∂17-Feb-82 0348 JMC film in space
C00259 00187 ∂17-Feb-82 0350 JMC
C00260 00188 ∂17-Feb-82 1553 JMC
C00261 00189 ∂18-Feb-82 1841 JMC
C00262 00190 ∂18-Feb-82 2241 JMC
C00264 00191 ∂18-Feb-82 2309 JMC more on simulation
C00265 00192 ∂20-Feb-82 1432 JMC
C00266 00193 ∂20-Feb-82 1432 JMC disjunctive knowledge
C00267 00194 ∂20-Feb-82 1521 JMC commute mileage for consultant
C00268 00195 ∂20-Feb-82 1603 JMC
C00269 00196 ∂20-Feb-82 1629 JMC
C00270 00197 ∂20-Feb-82 1634 JMC
C00271 00198 ∂20-Feb-82 1657 JMC letter for Teller
C00272 00199 ∂20-Feb-82 1718 JMC
C00273 00200 ∂20-Feb-82 1835 JMC
C00274 00201 ∂20-Feb-82 2142 JMC
C00275 00202 ∂20-Feb-82 2148 JMC iii trips Monday and Wednesday
C00276 00203 ∂20-Feb-82 2154 JMC L.A. trip
C00277 00204 ∂20-Feb-82 2214 JMC
C00278 00205 ∂21-Feb-82 0007 JMC
C00279 00206 ∂21-Feb-82 0105 JMC
C00280 00207 ∂21-Feb-82 0157 JMC
C00281 00208 ∂21-Feb-82 1409 JMC
C00282 00209 ∂22-Feb-82 0041 JMC
C00283 00210 ∂22-Feb-82 0403 JMC
C00284 00211 ∂23-Feb-82 1644 JMC
C00285 00212 ∂23-Feb-82 2246 JMC
C00286 00213 ∂24-Feb-82 0043 JMC
C00288 00214 ∂24-Feb-82 0044 JMC
C00289 00215 ∂25-Feb-82 1110 JMC
C00291 00216 ∂25-Feb-82 1421 JMC
C00292 00217 ∂25-Feb-82 1430 JMC Kuck paper
C00293 00218 ∂25-Feb-82 1743 JMC
C00294 00219 ∂25-Feb-82 1748 JMC
C00295 00220 ∂25-Feb-82 1751 JMC
C00296 00221 ∂25-Feb-82 1753 JMC
C00297 00222 ∂25-Feb-82 2122 JMC
C00298 00223 ∂25-Feb-82 2123 JMC
C00299 00224 ∂26-Feb-82 0016 JMC
C00300 00225 ∂26-Feb-82 1202 JMC
C00301 00226 ∂26-Feb-82 1337 JMC
C00302 00227 ∂26-Feb-82 1637 JMC
C00303 00228 ∂27-Feb-82 1536 JMC
C00304 00229 ∂27-Feb-82 1759 JMC
C00305 00230 ∂28-Feb-82 1433 JMC
C00306 00231 ∂28-Feb-82 1820 JMC Hayes quote
C00307 00232 ∂28-Feb-82 1832 JMC Wolfram
C00308 00233 ∂28-Feb-82 1848 JMC
C00309 00234 ∂01-Mar-82 0300 JMC meta-cognition: reasoning about knowledge
C00310 00235 ∂01-Mar-82 1156 JMC
C00311 00236 ∂01-Mar-82 1228 JMC
C00312 00237 ∂03-Mar-82 1546 JMC
C00313 00238 ∂03-Mar-82 1551 JMC
C00314 00239 ∂03-Mar-82 1700 JMC Common LISP discussion
C00315 00240 ∂03-Mar-82 1812 JMC
C00316 00241 ∂05-Mar-82 0112 JMC
C00319 00242 ∂05-Mar-82 0114 JMC
C00320 00243 ∂05-Mar-82 0318 JMC dinner with Ehud Shapiro
C00321 00244 ∂05-Mar-82 1416 JMC
C00324 00245 ∂05-Mar-82 1418 JMC
C00325 00246 ∂05-Mar-82 1419 JMC
C00328 00247 ∂05-Mar-82 1424 JMC
C00329 00248 ∂05-Mar-82 1449 JMC
C00330 00249 ∂05-Mar-82 1449 JMC reprint
C00334 00250 ∂07-Mar-82 1517 JMC Golux
C00335 00251 ∂07-Mar-82 1520 JMC
C00338 ENDMK
C⊗;
∂04-Jan-82 1411 JMC John romano
To: JMM
this hp student from Colorado 303 598-1900x2131 wants to know how
he's doing.
∂04-Jan-82 1602 JMC
To: FFL
Use Diffie's business address.
∂04-Jan-82 2111 JMC
To: RWG
New version of life[f81,jmc].
∂05-Jan-82 0003 JMC Note to Herb Caen
To: FFL
It tells me that It will keep raining until the last environmentalist
takes the brick out of his toilet tank.
∂05-Jan-82 0012 JMC
To: FFL
todoro.7
∂05-Jan-82 0024 JMC Using your system at Stanford
To: boyer at UTEXAS-20, moore at UTEXAS-20
I am thinking of having my course in theory of computation use your
prover this quarter for some problems. Are there any problems (technical
or proprietary) in importing the system to SCORE?
Alternatively, do you think SRI might be willing to let people use
it over the net on the Foonly they bought for you? Do you see any technical
problems and whom would I ask about it?
I have another problem about sublis(pattern, alist) and match(pattern,
expression, alist) being partial inverses that I have tried once and
failed. However, I'll try a couple more ideas before I bother you with
it.
∂05-Jan-82 1544 JMC
To: FFL
WADA.1
∂05-Jan-82 2211 JMC
To: FFL
lehman.1
∂05-Jan-82 2235 JMC
To: FFL
lindze.3
∂06-Jan-82 0057 JMC
To: RPG
Thanks for mail file info.
∂06-Jan-82 0059 JMC
To: rwg at MIT-MC
What number can I phone you at PARC?
∂06-Jan-82 1101 JMC Competitive life
To: RWG at SU-AI, rwg at MIT-MC
All gliders but one become homogeneous in color but
w
w
wbb
oscillates between 3 white and two black and the reverse. The geometric
phase and the color phase are synchronous. Of course, it isn't clear
that mixed gliders can be emitted by any kind of mixed glider gun.
Where do you prefer to receive mail?
∂06-Jan-82 1114 JMC
To: DON at SU-AI
LIFE[F81,JMC] proposes a competitive version.
∂06-Jan-82 1811 JMC
To: JJW
Please arrange with boyer%utexas-20 to ftp their prover to SCORE.
∂07-Jan-82 0039 JMC
To: RWW
What would be involve in reviving LCF for class experimentation?
∂07-Jan-82 0059 JMC computer use for CS258
To: csd.golub at SU-SCORE
As you recall, I arranged for SAIL use for CS206 in the Fall. However,
I recoiled in horror when I found out how many students there were in the
course and had them use LOTS. I want to retroactively consider that I
took a rain check and have the students use SAIL and also SCORE. Different
proof systems that I want them to use require the different operating systems.
There are only nine students in the class and they all turned out to have
SAIL accounts already; I didn't ask about SCORE.
∂07-Jan-82 1155 JMC life
To: rwg at MIT-MC
I had gone to bed when your message arrived only noticed it as I logged
in which made it disappear, so I didn't get it all. I assume a block
is a square of four points. In my version of competitive life, a square
doesn't oscillate, because a cell flips only if a majority of neighbors
including itself are of the opposite color. I think this is more likely
to lead to a decisive victory for one color than making it more oscillatory.
The oscillatory glider configuration was obtained on paper looking at
all ten gliders with 3 whites and two blacks.
∂07-Jan-82 1545 JMC admissions
To: csd.golub at SU-SCORE
Why do we allow any GRE but engineering?
∂07-Jan-82 1616 JMC
To: csd.golub at SU-SCORE
My query may be confusing. I mean why don't we allow engineering?
∂07-Jan-82 2112 JMC
To: KLC
There is no literature that I know of that mentions both except a sentence
or two in my paper. I agree that circumcscription might be used to establish
a sample space for probabilistic reasoning. I would be glad to discuss the
matter with you at a mutually convenient time - tomorrow afternoon any time
after 2:30 would be convenient for me. Since I don't remember any Wednesday
remarks, any apology is indeed moot.
∂08-Jan-82 0811 JMC
To: rwg at MIT-MC
W B
B W
won't blink according to my rules, because flipping requires a majority
including self. Of course, the rules can be as we choose, but for
the competitive game, it seems to me that my rules are more likely
to lead to a situation that can be called a victory. Experiment will
tell, however.
∂08-Jan-82 0848 JMC ekl problem
To: JK
I have been trying to use the new ekl to prove the associativity of append.
The axioms and declarations are in lispx.lsp[f81,jmc]. This file is redundant,
because it has both cons and an infix ~ that I am currently using for cons.
The proof as far as it goes is in lispx.ppr[f81,jmc]. I don't know how to
make the last step.
After you look, can I phone you?
∂08-Jan-82 0914 JMC
To: JK
I'll look.
∂08-Jan-82 1001 JMC
To: JJW
I'll be back to you. It will be some combination of the department
and overhead, but I'll have to talk to Golub.
∂08-Jan-82 1421 JMC funds for computing
To: JJW
∂08-Jan-82 1326 Gene Golub <CSD.GOLUB at SU-SCORE> funds for computing
Date: 8 Jan 1982 1321-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: funds for computing
To: jmc at SU-AI
cc: bscott at SU-SCORE
We shall try to cover the computer costs from the residual IBM funds.
GENE
-------
∂08-Jan-82 1546 JMC Computer accts
To: JJW
∂08-Jan-82 1545 Susan Hill <CSD.HILL at SU-SCORE> Computer accts
Date: 8 Jan 1982 1539-PST
From: Susan Hill <CSD.HILL at SU-SCORE>
Subject: Computer accts
To: jmc at SU-AI
cc: csd.gotelli at SU-SCORE
Betty said something about your asking for permission for students in your
class to have computer accounts. How do you plan to handle this?
-------
∂09-Jan-82 0019 JMC lispx inelegances
To: JK
lispx.lsp[w82,jmc] is a source file, and lispx.ppr and lispx.prf are the others.
I wanted to get the sort information and the facts about append entirely
into a symbolic form. In order to do this I followed each line containing
such information by a LINENAMES that updated the line in question. It worked,
but there are the following inelegances.
1. I had to answer the question of whether I really meant it after
each use of LINENAMES for updating purposes, so there is a line containing
y after each such line.
2. SORTINFO has extra lines.
3. In the .ppr file, the command still comes out with some of the
numerical line number information instead of the purely symbolic information
that went in.
∂09-Jan-82 0020 JMC more on lispx
To: JK
It is elegant to be able to do the append proof essentially in one line.
I don't yet fully understand how it works, and I'll have to ask you some
questions.
∂09-Jan-82 0126 JMC
To: rwg at MIT-MC
Indeed!
∂09-Jan-82 0150 JMC more lispx
To: JK
I have added a definition of
flat(x,u) = if atom x then x.u else flat(car x,flat(cdr x, u))
but don't understand rewriting well enough yet to know how far I
can get toward
∀x u.listp flat(x,u)
in one ∀e step.
∂10-Jan-82 0044 JMC
To: JK
Is the following a bug? If not how do I get use an axiom ¬p to get
if p then a else b = b?
the proof BUG:
(DECL (P) |TRUTHVAL| CONSTANT)
(DECL (A B) |GROUND| CONSTANT)
(ASSUME |¬P|)
3. ¬P
ctxt: (1) deps: (3)
(TRW |IF P THEN A ELSE B| |*3*NIL|)
4. IF P THEN A ELSE B=IF P THEN A ELSE B
ctxt: (1 2) deps: (3)
(ASSUME |P|)
5. P
ctxt: (1) deps: (5)
(TRW |IF P THEN A ELSE B| |*5*NIL|)
6. IF P THEN A ELSE B=A
ctxt: (1 2) deps: (5)
∂10-Jan-82 0046 JMC
To: JK
∂09-Jan-82 0933 JK
∂09-Jan-82 0150 JMC more lispx
I have added a definition of
flat(x,u) = if atom x then x.u else flat(car x,flat(cdr x, u))
but don't understand rewriting well enough yet to know how far I
can get toward
∀x u.listp flat(x,u)
in one ∀e step.
------------
Assuming that ∀x u.sexp flat(x,u) is clear, one could just instantiate
a case of car induction for ∀u.listp flat(x,u)
and that should go in one step.
------------
∀x u.sexp flat(x,u) isn't clear, since that would also amount to the
termination of the program. Even so I don't see how it would be
used.
∂10-Jan-82 1735 JMC more flat
To: JK
CC: JJW
I now understand your proof of
∀x u.listp flat(x,u)
The next one Joe and I tried was
∀x u. flat(x,u) = flatten x * u
where
flatten x = if atom x then list x else flatten(car x) * flatten(cdr x)
The necessary definitions along with various junk (to be cleaned out)
are in lispx[w82,jmc].
We are still having difficulty in working out the technique of the new
rewrite modes, but I think it is worthwhile to debug our technique with
the present mode, even though I suspect another major change will be
wanted eventually. The present scheme is looking like a macro language,
and they usually need to be modified as they become more programmable.
∂10-Jan-82 2333 JMC
To: reid at SHASTA
BIOJMC[1,JMC] is a vita in PUB.
∂11-Jan-82 1834 JMC
To: csd.irmgild at SU-SCORE
Dr. Keith Clark
Department of Computing
Imperial College of Science and Technology
University of London
l80 Queen's Gate
London SW7 2BZ, England
∂11-Jan-82 2328 JMC bug?
To: JK
I don't know whether it's a bug or my misunderstanding, but I can't get
ekl to expand out x~nnil*v. The last line on p. 2 of lispx.lsp[w82,jmc]
is my attempt. I got it to expand flat and flatten with a simpler
mode, which I have been elaborating, but it goes no further.
∂12-Jan-82 0008 JMC
To: JK
Cancel previous message; I have got through my difficulty.
∂12-Jan-82 0135 JMC
To: JK
New bug
Step 47 in lispx.lsp[w82,jmc] or lispx.prf[w82,jmc] is produced by the
command below it. Step 51 above (not in lispx.prf) was produced by
the same command with $ in place of the &. The & was an attempt to
get it to expand flatten without again expanding flat. How is that
to be done? I want a mode that will use all applicable occurrences
of the line range referred to but won't expand the results of expansions.
Then I could expand all definitions in part of the formula with a
single reference to DEFINFO without danger of a loop.
The bug is that the term (x~y)~nil*u should be
(flatten(x)*flatten(y))*u.
∂12-Jan-82 1602 JMC proposal
To: JK
The proposal left Stanford Dec. 29. I got a postcard confirming its
reception from NSF. It has the proposal id no: MCS 8206565.
∂12-Jan-82 2134 JMC
To: ROY
Imlac conked out agin - won't load.
∂12-Jan-82 2150 JMC
To: RWW
I know of no way to relieve your nesslessness.
∂13-Jan-82 0259 JMC
To: ROY
It came back to life after temperature changes.
∂13-Jan-82 0323 JMC lisp axioms
To: YOM
My current version with working material removed is LISPAX.LSP[W82,JMC].
There are still a few changes to be made in order to maximize convenience.
∂13-Jan-82 1051 JMC
To: csd.walker at SU-SCORE
Yonatan Malachi was a high pass. Frank Yellin was a pass. Joe Weening
didn't pass but will take it again in late February.
∂13-Jan-82 1101 JMC
To: ef at MIT-AI
Alas, I can't take the time to go to the Information Mechanics Meeting.
∂13-Jan-82 1142 JMC
To: REG
∂13-Jan-82 1135 JJW SCORE account for Boyer-Moore system
I asked Lynn Gotelli for 60 aliquots, which is 3180 blocks
(Boyer said we need 3200), but she has told me that there are only
555 blocks left to be sold on SCORE. So I don't know how we will
be able to bring up the theorem-prover unless something is done to
free up disk space at SCORE.
∂13-Jan-82 1155 JMC
To: JJW
I'll start politicking.
∂13-Jan-82 1327 JMC system
To: ME
I have noticed that in the last few months, the load levels have been
somewhat lower, especially the residual load level when no-one is
doing anything. Is this a real change or just a change in the way
things are measured?
Formerly the load was (as I remember it) never beow .10, and now it
goes down to .04.
∂13-Jan-82 1417 JMC
To: FFL
Knuth, Donald E., DECIPERING A LINEAR CONGRUENTIAL ENCRYPTION, 1980. ONR
please have a copy of this sent to Whit Diffie
∂13-Jan-82 1440 JMC
To: JK
Thanks; you can expect at least a few to be my bugs.
∂13-Jan-82 1853 JMC proof done but could be improved
To: JK
lispx.ppr[w82,jmc] has the proof. The main parts are done in
single rewrites, but the loose ends are done separately. I would be
grateful if you would look at it from the point of view of style.
1. Can it be improved to reduce number of steps?
2. How should I change it as a model for CS258 students?
3. Does it suggest improvements to EKL?
In any case I plan to separate the proofs about flat from the
basic LISPX proof.
∂13-Jan-82 2136 JMC new bug
To: JK
The proof went through ok, but I decided to clean matters up by separating
the basic lisp axioms (now called lispax.lsp and lispax.prf) from the
definitions and proof peculiar to flat. The lispax part went ok and so
did flat up to the point when I did (pretty-proof flat flat).
(save-proofs flat) had worked ok. I got some kind of lisp error and then
tried (show) and got the error message you will find in flat.lsp[w82,jmc].
Running the proof again worked, but (show) failed again. In the previous
lispx context, I had no trouble with (pretty-proof).
Another subject: Part of the difficulty with proving the facts about
flat was that there is no direct way to use the premisses of an
implication in rewriting the conclusion. If you can figure out how
to make this possible, at least two of the proofs will be more
straightforward. In particular,
∀x y.(∀u.flat(x,u) = flatten(x)*u) ∧ (∀u.flat(y,u) =flatten(y)*u)
⊃ flat(x,flat(y,u)) = flat(x)*(flat(y)*u)
is obtainable as a valid formula in this way. Perhaps der could do
this or try this or let the user try it.
The proof of ∀x.listp(flatten x) would also be more straightforward
were this possible.
∂13-Jan-82 2156 JMC more on bug
To: JK
I tinkered with the file a bit more and changed the bug. I added the
command that proves ∀x u.listp flat(x,u), and this put another step
in the proof. Again the proof ran without difficulty and produced
the desired results. However, this time (save-proofs flat) got into
an apparently infinite loop.
∂14-Jan-82 1950 JMC improved lname
To: JJW
Could lname generate a (comment) line of the form (COMMENT LNAME foo baz)
so that .ppr files would have the line names attached to the axioms?
∂16-Jan-82 1705 JMC
To: RPG
Try to get LLNL to pay half.
∂16-Jan-82 2026 JMC
To: FFL
russel.3
∂17-Jan-82 2313 JMC your axioms
To: YOM
I have looked at them. In the main you have the right facts, but they
require many changes to make them suitable for ekl proofs. Mainly they
need to be put as much as possible in forms that can be used as rewrite
rules in which the left side is replaced by the right side. Those that
can be used indefinitely need to be separated from those that can't such
as recursive definitions and commutativity. Associative operations need
to be declared such. There are also some bugs, such as leaving out the
conclusion of the induction axiom.
∂18-Jan-82 1056 JMC
To: csd.hill at SU-SCORE
Gosper should still have a courtesy account, but probably of minimum
magnitude. Is this the minimum now, and if not, what are his quotas?
I don't imagine he uses anything but SAIL.
∂18-Jan-82 1110 JMC
To: reid at SHASTA, csd.schreiber at SU-SCORE,
csd.herriott at SU-SCORE
1. This course description ignores the existence of 156.
2. In my opinion, the description contains much
material, e.g. automata, formal languages and Turing machines, that
shouldn't be in a basic course. It is an obsolete carryover from the
time when computer science theory was an offshoot of mathematics.
It should be covered sketchily in advanced courses.
3. I won't vote for it as a math sciences option in its present form,
but its content is really more the business of the computer science
department than of the math. sciences committee.
∂18-Jan-82 1341 JMC
To: csd.hill at SU-SCORE
I'll find out something of what he's doing. There are other possibilities
for his disk. I'll be back to you.
∂18-Jan-82 1344 JMC
To: reid at SHASTA
Perhaps I was hasty. I don't think a week-by-week outline should be asked
of you, any more than from anyone else. I'll react further later.
∂18-Jan-82 1647 JMC
To: YOM
(DECL (*) |GROUND⊗ground*→GROUND| functional NIL INFIX 840 both)
∂18-Jan-82 2205 JMC
To: JJW
Many people already have used up some of the single character e macro names.
∂18-Jan-82 2332 JMC m and b
To: JJW
I have rewritten it and checked it with ekl. I'll show you the files
tomorrow.
∂19-Jan-82 1252 JMC
To: RDG
m and b is ready
∂19-Jan-82 1252 JMC
To: RDG
essentially ready
A partial message was sent by mistake. Here's the whole message.
I have declared *, i.e. append, to be associative, and this seems to
work fine; it makes one of the proofs go without special appeal to
associativity. I have advocated to Yoram that he declare + and times
to be associative also. However, it occurs to me that declaring them
associative may cause problems in using their commutativity. Suppose,
for example, that we want to prove a+b+c+a = a+a+b+c. If EKL doesn't
allow us to group the terms freely, then there will be difficulty in
using associativity. There will also be a problem in matching
subexpressions. It seems to me that allowing operators to be
declared associative is good and even necessary, but it imposes further
requirements on interactive theorem provers such as EKL. These seem to
include
1. Parts designators should be able to pick out segments, e.g. b*c
should be a part of a*b*c*d.
2. Matching the operator should try to match segments. It is important
here whether the null segment should be considered, and this depends
on the operator. Thus the matches of x*y*z against a*b*c*d are (nil nil a*b*c*d),
(nil a b*c*d), (nil a*b c*d), (nil a*b*c d), (nil a*b*c*d nil),
(a nil b*c*d), (a b c*d), (a b*c d), (a b*c*d nil), (a*b nil c*d),
(a*b c d), (a*b c*d nil), (a*b*c nil d), (a*b*c d nil), (a*b*c*d nil nil)
in the unrestricted case and the three without nil in the restricted case.
If an operator could be declared both commutative and associative, there
are many more considerations.
1. Ideally the expression should be represented internally by a multi-set
of arguments. Arbitrary sub multi-sets should be designatable and
matched.
2. Because the ideal becomes very expensive, the user needs to be able
to restrict the potential matches that will be examined. It will require
experience to determine what restrictions should be available.
∂19-Jan-82 1551 JMC paper
To: FFL
Please send Home terminal paper to
Harold Gilliam
1747 10th ave
SF 94122
∂19-Jan-82 1650 JMC
To: JK, JJW, YOM
A partial message was sent by mistake. Here's the whole message.
I have declared *, i.e. append, to be associative, and this seems to
work fine; it makes one of the proofs go without special appeal to
associativity. I have advocated to Yoram that he declare + and times
to be associative also. However, it occurs to me that declaring them
associative may cause problems in using their commutativity. Suppose,
for example, that we want to prove a+b+c+a = a+a+b+c. If EKL doesn't
allow us to group the terms freely, then there will be difficulty in
using associativity. There will also be a problem in matching
subexpressions. It seems to me that allowing operators to be
declared associative is good and even necessary, but it imposes further
requirements on interactive theorem provers such as EKL. These seem to
include
1. Parts designators should be able to pick out segments, e.g. b*c
should be a part of a*b*c*d.
2. Matching the operator should try to match segments. It is important
here whether the null segment should be considered, and this depends
on the operator. Thus the matches of x*y*z against a*b*c*d are (nil nil a*b*c*d),
(nil a b*c*d), (nil a*b c*d), (nil a*b*c d), (nil a*b*c*d nil),
(a nil b*c*d), (a b c*d), (a b*c d), (a b*c*d nil), (a*b nil c*d),
(a*b c d), (a*b c*d nil), (a*b*c nil d), (a*b*c d nil), (a*b*c*d nil nil)
in the unrestricted case and the three without nil in the restricted case.
If an operator could be declared both commutative and associative, there
are many more considerations.
1. Ideally the expression should be represented internally by a multi-set
of arguments. Arbitrary sub multi-sets should be designatable and
matched.
2. Because the ideal becomes very expensive, the user needs to be able
to restrict the potential matches that will be examined. It will require
experience to determine what restrictions should be available.
∂19-Jan-82 1654 JMC
To: JK
Aha. You're ahead of me.
∂20-Jan-82 1254 JMC organization meeting for Porto course
To: FFL
PROLOG[W82,JMC] is an announcement of Porto's course. It lacks a place
for the organization meeting. Please get a room for (say) 15 people
and add it to the announcement. It should be mailed to bulletin boards
at SAIL, SCORE and SRI-AI and PARC. Get Arthur or RPG to tell you how.
∂20-Jan-82 1357 JMC
To: RDG
See pages 4 and 5 of APE.LSP[W82,JMC].
∂20-Jan-82 1835 JMC
To: twe.hp-labs at UDEL
Course in logic programming and Prolog starting soon
Starting in the week of February 2 and continuing through the
quarter there will be a course in logic programming and the Prolog
language taught by Antonio Porto of the University of Lisbon. Logic
programming in general and Prolog and particular have attracted wide
interest in Europe but are only getting started in the U.S.
There will be an opportunity to use Prolog.
There will be an organization meeting to fix hours on Thursday,
January 28 at 3pm. Anyone interested who can't make the meeting or who has
questions should contact John McCarthy by telephone or net message.
∂20-Jan-82 2036 JMC
To: warren at SRI-AI
He'll arrive on the 26th.
∂21-Jan-82 0051 JMC Hurd title
To: csd.golub at SU-SCORE
Is it too late to get Dr. Hurd's former title correct. I'm sure it
wasn't "project manager", and I think it was something like "Director
of Data Processing".
∂21-Jan-82 2102 JMC
To: JJW
Ten it is.
∂21-Jan-82 2318 JMC
To: rem at MIT-MC
I have no special reason to suppose that I can be much help, but if you
would like to have dinner some evening and discuss your problems, I would
be glad to do it - perhaps early next week.
∂22-Jan-82 2034 JMC
To: katz.hp-labs at UDEL
The point of the organizational meeting is to set a time for the class.
As it happens, Porto won't arrive till the day after the organizational
meeting which will be held as announced. Therefore, all it can do is
set a time. It would be best for you to try to be represented.
∂22-Jan-82 2322 JMC
To: llw at S1-A
Congratulations on Lawrence award.
∂23-Jan-82 0055 JMC Umnov and Roth
To: TOB
Please look at UMNOV.NS[W82,JMC]. I think the statement by Bernie Roth that
we learned about robotics from the Russians is a total exaggeration, and the
statement that it is impractical to put restrictions on Umnov if he visits
is essentially false. I am thinking about a letter saying so either to the
Stanford Daily or the New York Times. This is is independent of the question
of whether such restrictions are desirable. What is your opinion?
∂23-Jan-82 0125 JMC
To: TOB
See also DAILY.7[LET,JMC] for a draft.
∂23-Jan-82 1104 JMC
To: TOB
Would you be willing to take part in a joint letter or even a press conference
dissenting from the official Stanford view? We might ask a few other people,
e.g. Cannon and deBra, but we'd do something even if they weren't inclined
to participate. I guess a letter is appropriate in any case and a press
conference if there are enough, say 4 or 5.
∂23-Jan-82 1801 JMC Gosper
To: CSD.HILL at SU-SCORE
CC: RWG at SU-AI
He should be reduced to the half-an-aliquot guest level.
He will move some files elsewhere.
∂23-Jan-82 1814 JMC running out of screeen while running out of E
To: RPG, ME
My experience in running out of E convinces me that our work would be
improved by the ability to display a lot more characters. No matter
how nicely they are arranged on the screen, there just aren't enough.
Would it be feasible, for experimental purposes, to make the E-system
interface convenient for someone who had two or even four datadiscs?
I think this is worth doing soon in spite of the current shortage of
datadisc channels, because it is relevant to the question of whether
having lots of characters is more important than having beautiful
characters. My conjecture is that having two or four low resolution
displays will prove more valuable than having a high resolution display
with the same number of pixels unless the high resolution display is large
enough so that just as many characters can be put up non-microscopically.
∂23-Jan-82 2316 JMC improved string search
To: cl.boyer at UTEXAS-20, cl.moore at UTEXAS-20
Here is an "improvement" on your string search whose correctness statement
might be difficult to formalize. The algorithm is essentially that given
in your book, except for a change in the initialization to avoid updating
the table for all letters of the alphabet. Each entry in the table includes
your (DELTA1 K) in its low order bits and an integer <search number> in its
high order bits. When we start a new search, we update the entries
corresponding to the letters in the pattern string but with a search number
one larger than that of the last search. We don't bother changing the
entries for letters that don't appear in the pattern string, because a
simple comparison when the letter is encountered in the text shows that
the entry is obsolete. Only when the search number threatens to overflow
the allocated field do we go through the entire table and restart with
search number 1.
Since I don't know the literature and couldn't find a reference to this
kind of searching in Knuth vols. 1-3, this may be an old idea.
Notice that stating the correctness and the efficiency of the algorithm
requires taking into account that the algorithm may be used many times.
∂24-Jan-82 0006 JMC
To: RWG
Should your situation change to need more disk here, it will be arranged.
∂24-Jan-82 0121 JMC flap about Soviet robotics visitor
To: llw at S1-A
Page 80 of \bboard at SU-AI contains an AP dispatch and commentary by
various people including me about Stanford declining to restrict a
Soviet visitor and the State Department cancelling the visit. I made
some speculation about the bureaucratic process. Can you (dis)confirm
them, and do you know more?
∂24-Jan-82 1752 JMC
To: JPM
What I know came from Ralph. Perhaps I should not have spoken to the reporter
at all given that fact, but I felt obliged to convince her (Alice Cuneo in case
you should have the misfortune to meet her) that the computer couldn't be used
to fire missiles or write checks. If someone offers $3.5 million for the
system in Margaret Jacks, the Department should accept.
∂24-Jan-82 2333 JMC
To: feigenbaum at SUMEX-AIM
∂23-Jan-82 HPM 24-Jan-82 JMC Secure robots
a021 0047 23 Jan 82
PM-Scientist, Bjt,580
Universities Rebuff State Department Restrictions on Soviet Visitor
STANFORD, Calif. (AP) - A widening dispute over the federal
government's attempt to extend anti-Soviet sanctions to academia has
lopped two universities from the itinerary of a Soviet scientist whose
specialty is robots.
Stanford University has been declared off-limits to Nikolay Umnov
because the school refused to honor State Department restrictions on
his visit. The university said it could not successfully police a
visit, and that to make the attempt would disrupt the free environment
needed for creative work to take place.
The University of Wisconsin followed Stanford's lead Friday, saying
it was an ''open institution.''
Wisconsin Asssociate Dean Camden A. Coberly and professor Ali A.
Seireg said they plan to withdraw their acceptance of Umnov's visit.
That move will reduce the scientist's itinerary to Auburn University
and Ohio State University.
But at Ohio State University, where Umnov was to spend six weeks,
professor Robert B. McGhee said Umnov would be ''welcome for two or
three days. I'd accept restrictions for a visit of that length, but
not any longer.''
Umnov has been caught in a dispute over what visiting Soviet
scientists can see and do during a three-month scientific exchange
program that is sponsored by the National Academy of Sciences and
funded by the U.S. government.
As part of the Reagan administration's attempt to restrict Soviet
access to U.S. technology, the State Department said Umnov couldn't
see anything not already published in open literature.
It also said he should be restricted to mechanical theory of robotic
locomotion, with no industrial visits and no access to control units
or computer programming techniques that have given robots new
flexibility and made them more useful in the workplace.
The measures are justified because the government is paying for the
visit, said Sue Pittman, a State Department spokeswoman. She also
cited ''possible technology transfer risks,'' an administration term
for thefts or leaks of U.S. scientific secrets.
The restrictions reached universities hosting Soviet scholars via
letters from the national academy. As criticism of the restrictions
mounted, the NAS on Tuesday halted distribution of the letters.
The restrictions are ''absurd,'' according to Bernard Roth, a
professor in Stanford's Department of Mechanical Engineeering.
''Guys in the U.S. who know something about it (robotics) learned
from the Russians,'' he said. Potential military applications are
''very small. ... I don't think anyone will win a war on the basis of
those machines. It's certainly not of critical national interest.''
He added that nothing is being done in the field that the Soviets
''either don't already know or can easily figure out for themselves.''
In refusing to honor the restrictions, Stanford Vice-Provost Gerald
J. Liberman said, ''We believe the best interests of American science
and technology are served by open exchanges of university research
activities.''
He said in a letter to the NAS, ''The campus is completely open; and
the thousands of visiting scholars to campus each year have free
access to any of the university's programs. Even if we had the means
to monitor or police the activities of visitors, such actions would
drastically disrupt the academic environment which is essential in
fostering creative research endeavors.''
Attempts to restrict visiting scientists are not new, and last
February Stanford President Donald Kennedy expressed ''grave concern''
over federal attempts to apply export controls to academic teaching
and research. He was joined in writing protests to the secretaries of
state, defense and commerce by presidents Marvin L. Goldberger of the
California Institute of Technology, Paul E. Gray of MIT, Frank H.T.
Rhodes of Cornell and David S. Saxon of the University of California.
Kennedy told the faculty senate earlier this month the universities
had done ''sporadic negotiating'' with some agencies and had had
''skirmishes'' with others.
ap-ny-01-23 0346EST
***************
kjk - Question for the robotics people: isn't Umnov in robot locomotion?
Aren't the Russians significantly ahead of us in locomotion?
What are the expected gains from Russian→US technology transfer vs.
US→USSR?
In other words, do we stand to gain more than Russia from Umnov's
visit? If so, a letter to the State Department informing them that they
are applying an import restriction rather than an export restriction
may be in order.
A brief review of the status of known Russian work in robotics might
be useful for clarifying the tradeoffs. Is anyone here willing to do that?
Lest people get the wrong impression--I'm opposed to applying
export restrictions to academic work. I think the State Dept is wedged.
However, a specific instance of the loss we incur from these restrictions
may do more than a thousand pages of moral, ethical, and philosphical
argument.
TAW - If the US Gov't doesn't want Umnov to know anything about
state-of-the-art robotics, why are they letting him in?? That seems
to be the way to handle these things, as opposed to making every
US technologist in a sensitive field take Diplomacy courses.
JMC - I think that both Roth and Lieberman have made misstatements in
order to make their case stronger. In my knowledge and Tom Binford's,
the Russians are mainly behind us in robotics. Only in walking machines
have they done anything substantial. Of course, they are very secretive
about what they do, and before they receive any visitor at an institute,
they determine what he may and may not be shown and what may be discussed.
Many institutes are secret and known only by Post Office Box numbers within
the country. When people from one such institute (the Institute of Applied
Mathematics in Moscow) wanted to talk with me in 1965, they pretended to
be from a different institute. Only later, when that institute wanted to
buy an American computer, did its existence emerge from secrecy; I never
got to visit it.
My attempts to collaborate with Ershov on MTC broke down mainly because
it was illegal for him to put scientific information in a letter except
by sending published documents. It is illegal for a Russian to give a
foreigner written scientific information except in the form of published
books or papers. In the 1960s, these rules were often bent, but exceptions
have been few since then.
Roth is also wrong in saying that robotics has no
military applications. Lieberman's statement
''We believe the best interests of American science
and technology are served by open exchanges of university research
activities.'' contains the assumption that putting no restrictions
on Umnov would achieve that result.
Finally, the statement that restrictions are impractical and would
disrupt the University is phoney. A visitor's schedule is made by
the University's "Office of Foreign Visitors", and nothing is easier
than leaving something off the schedule and notifying the Principal
Investigators of a few DoD sponsored projects that this has been done.
It doesn't prevent someone who wants to from telling all in the coffee
shop, but it would probably satisfy the State Department and have a
high probability of accomplishing what they want.
It is often argued that the Soviets can get all the information they
want by monitoring the literature. It isn't easy to tell to what
extent this is true. Certainly they are often behind in many areas,
and in many areas of computer science, their work is derivative - e.g.
putting on a Soviet computer systems done earlier in the U.S. Of course,
there is the possibility that derivative work is all we hear about.
Overall, it seems that restrictions have important but random effects.
Of course, the restrictions the Soviets place on travel by their own
people are far more effective than our restrictions, but the effects
are additive.
Stanford is imposing restrictions on access to information, because the
Center for Integrated Systems will give special access to the companies
that are paying for it. Even the Computer Forum gives special access to
its members. The CIS has been agonizing for the better part of a year
about how best to give privileges to the 12 companies.
All the above constitutes criticism of the misstatements by Roth and
Lieberman. There still remains the question of whether the particular
action of the State Department is reasonable. If I had to make a
decision myself, I'd want more information about what the Russians do,
how open they have been, and what the military applications are.
On the basis of my experience and the information contained in the
article, the State Department position seems a reasonable compromise.
In contrast to this, Stanford seems to be taking an absolutist position,
and its spokesmen are inventing facts to fit the desired conclusions.
Perhaps the position is a leftover from the 1960s.
Apart from cost-benefit considerations, there is a political issue.
The AP story will be summarized in the Soviet press
as follows: "In spite of the efforts of
the mad dog Reagan to whip up anti-Soviet hysteria over the false
issue of Poland, American scientists realize the leading role of
the Soviet Union in robotics as in other fields. They know the
Polish issue is false". For more restricted circles,
the assurance may be offered that Comrade Umnov is politically
mature and will make certain that he gets more than he gives.
Should anyone wish to be actually constructive about exchanges
with the Soviet Union, I would suggest the following:
1. Form an estimate of what the Russians are doing in certain fields,
e.g. robotics or computer science generally. Make a guess as to where
they are being open and where they are being secretive. The CIA, which
works for us you know, could be asked to help; it interviews many
emigrants from the Soviet Union and has other sources of information.
2. If we decide there is something we want to know or institutions we
think we would like to visit, the State Department or the National
Academy of Sciences can bargain on our behalf. Their bargaining will
be more effective if they get our co-operation. Our problem will be
that very few scientists will find the Soviet Union interesting enough
for long visits.
Maybe it isn't worth the trouble, however. Perhaps the effort
would be better spent on deciding what open Japanese publications to
translate.
Comments on the comments: KJK wants to be sure people won't get him
wrong. Let it be recorded that his views are orthodox.
TAW wants to know why the Government lets Umnov in at all if they want to
restrict what he learns. Often the Defense Department wants to restrict
a Soviet visitors or argues against letting him in. The
present case has the earmarks of one where the Defense Department opposed
the visit, and the State Department got a compromise. The State Department is
in the business of making agreements and generally prefers admitting them.
However, the State Department is often more aware than others of
bargaining considerations. For example, Americans were able to visit
Novosibirsk before any other foreigners including Soviet satellites in the
1960s while it was still a closed city, because the State Department had
mapped it on Pittsburgh and wouldn't let Soviets visit Pittsburgh until
Americans visited Novosibirsk. The National Academy of Sciences likes
exchanges. Individual American scientists like visits and don't much care
if the exchange is very uneven. In fact, I have found it good for the ego
to be on the informative side of such conversations. Only later do I
notice that I have learned almost nothing.
JMC - There is one consideration in favor of accepting grossly uneven
"exchanges" of information. Our openness and even naivete has a
psychological effect on Russians. There is some hope that it makes our
society look better, and some people believe this strongly. However,
emigres and dissidents who have come to dislike Soviet society are
very vehement against Western naivete. On balance, I'd bet that it's
to our disadvantage to look like suckers.
∂25-Jan-82 0201 JMC
To: LLW at SU-AI
Your remarks have been interpolated.
∂25-Jan-82 0548 JMC
To: ARK
CC: YOM
∂25-Jan-82 0300 ARK Yoram Moses request advisor change
∂25-Jan-82 0246 YOM Advisor
Hi Arthur!
Please change the listing of my advisor from Floyd to McCarthy.
Thanks, Yoram.
ARK - Is this OK with you?
JMC - Yes.
∂25-Jan-82 2120 JMC
To: ARK
ok
∂26-Jan-82 1034 JMC
To: FFL
Thanks Fran. Professor McCarthy has no further comment.
∂26-Jan-82 1309 JMC
To: atp.bledsoe at UTEXAS-20
I think we should write separate letters and will write mine.
∂27-Jan-82 1521 JMC
To: DCO at SU-AI
Please update your directory entry or plan to give present co-ordinates.
∂27-Jan-82 1526 JMC
To: llw at S1-A
Lowell:
I believe the people supported under that contract now mainly work
for LLL. What would be the possibility of either waiving that report or
getting the Livermore contract people to accept a one page report? Otherwise,
you could lend us Jeff for a few weeks.
John
∂25-Jan-82 1323 Betty Scott <CSD.BSCOTT at SU-SCORE> LLLContract 9628303
Date: 25 Jan 1982 1316-PST
From: Betty Scott <CSD.BSCOTT at SU-SCORE>
Subject: LLLContract 9628303
To: JMC at SU-AI, CSL.FB at SU-SCORE, CSL.JLH at SU-SCORE
cc: CSD.BScott at SU-SCORE
Proposal Entitled: "An Operating System and Memory Switch for the S-1
Computer," John McCarthy, P.I.
A final report on this contract was apparently due at the end of
December, 1979. It is difficult for me to determine whether John
McCarthy was actively engaged in the research, or whether Forest Baskett
and John Hennessy performed most of the research. Anyway, I am sending
each of you a copy of the proposal. The performance period was January 1,
1978, through December 31, 1979, and the funding totaled $304,472.
A final payment of approximately $3,500 is due Stanford from LLL, and they
won't pay until the report is submitted--15 copies of it. If the report
is not submitted LLL could conceivably disallow the entire contract,
leaving us holding a $304K "bag."
Would you please let me have a final report just as soon as possible. I
will have it duplicated and sent.
Thanks very much,
Betty
P.S. The LLL delay in notifying us of the above is apparently due to their
inability to locate their paperwork until recently--after hiring some
consultants to get their files in order. -- Thanks again.
-------
∂27-Jan-82 1816 JMC
To: jonl at MIT-MC
I didn't get your "Two little ...
∂29-Jan-82 1532 JMC
To: morris at PARC-MAXC
Just come to the course which will be Mon and Wed at 11 in Room 301 Margaret Jacks
Hall.
∂29-Jan-82 1533 JMC
To: oppen at PARC-MAXC
Well, I see you're still keeping your PARC location secret.
∂29-Jan-82 1535 JMC
To: BCM
mrc:<prolog>prolog at SCORE is the command.
∂29-Jan-82 1536 JMC
To: mccall at PARC-MAXC
Monday and Wed at 11 in 301 mjh.
∂29-Jan-82 1546 JMC
To: RPG
I don't know Arthur Norman, and I'm not inclined to give Denne an
account to be come acquainted with LISP and SAIL. If it were something
that exists here uniquely like EKL, I would do it, but there
are LISPs and Algol-like languages in England and presumably at
Cambridge, and the differences aren't worth fussing about.
∂29-Jan-82 2144 JMC
To: BCM
It has been removed from the disk; watch for its return.
∂29-Jan-82 2150 JMC report and next friday
To: LLW at SU-AI
I plan to spend next Friday at LLL and will try to catch Jeff and write
something then.
∂29-Jan-82 2207 JMC
To: SGF
Are you in a position to get your own terminal yet?
∂30-Jan-82 0032 JMC report to LLL
To: csd.scott at SU-SCORE
Well, it seems we have to do something, but one or two pages may do it,
and I'm going to Livermore next Friday anyway. Can you send me a list of
who was paid by the contract, so I can report what they did?
∂30-Jan-82 1711 JMC Antonio Porto
To: csd.hill at SU-SCORE
I have created a SAIL login for him AP. It should have one aliquot
and be charged to my ARPA. If he comes to see you about a SCORE
account, an aliquot can be charged also. He is a visiting scholar
from Portugal and will be teaching a course in Prolog.
∂30-Jan-82 2040 JMC
To: YOM
What progress are you making with your axioms for natural numbers?
∂30-Jan-82 2041 JMC
To: RJA
What are you up to these days?
∂31-Jan-82 1146 JMC
To: CLT
no problem
∂31-Jan-82 1722 JMC
To: feigenbaum at SUMEX-AIM
Do you think the following is ok for presentation to Lieberman along with
the AP story and the Stanford press release. In particular, can you
support it?
FACULTY STATEMENT ON SOVIET VISITORS
We are distressed by the situation described in the attached
Associated Press story. It gives the impression that Stanford takes an
attitude of total opposition towards the Government's efforts to restrict
technology transfer to the Soviet Union. Moreover, this attitude seems to
be supported by a number of untrue statements, namely (1) The Soviets are
ahead of the U.S. in robotics. (2) Robotics has no military applications.
(3) There are no possible restrictions on Soviet visitors that won't
disrupt the functioning of the University. We are further distressed that
that when the Soviet Consulate in San Francisco reported on the situation
to Moscow, this report probably re-inforced the idea in Moscow that
American protests about Poland and Afghanistan were a governmental sham
without any support in the institutions of the country such as
universities.
We believe that Stanford should adopt a policy toward Soviet
visitors that balances the following considerations:
1. Preserving the orderly functioning of the academic processes of
research, publication and teaching and avoiding the creation of a security
atmosphere.
2. Showing the visitors a society more open than their own.
3. Minimizing transfer of militarily useful technology so as to
minimize our own defense costs; perhaps we can help obviate the need for a
return to the draft. Ways of implementing this without security measures
need study.
4. Increasing reciprocity so that access to Soviet research
becomes available to Americans to the same extent that our research
activities are accessible to them. This involves some degree of support
to the bargaining efforts on our behalf conducted by the State Department
and the National Academy of Sciences.
5. Maintaining good relations with the State Department, the
Defense Department and other Government agencies.
Since these goals are not entirely co-incident, some degree of
compromise is needed.
We suggest that a committee be appointed to develop a policy. If
an interim statement clarifying the impression given by the Stanford press
release could be made, it might help mitigate the unfortunate signal that
has been sent to Moscow.
∂31-Jan-82 1724 JMC
To: llw at S1-A
You may be interested that some faculty are meeting with Lieberman on
the subject (he doesn't want us to get the wrong impression). The following
is my attempt to be diplomatic.
FACULTY STATEMENT ON SOVIET VISITORS
We are distressed by the situation described in the attached
Associated Press story. It gives the impression that Stanford takes an
attitude of total opposition towards the Government's efforts to restrict
technology transfer to the Soviet Union. Moreover, this attitude seems to
be supported by a number of untrue statements, namely (1) The Soviets are
ahead of the U.S. in robotics. (2) Robotics has no military applications.
(3) There are no possible restrictions on Soviet visitors that won't
disrupt the functioning of the University. We are further distressed that
that when the Soviet Consulate in San Francisco reported on the situation
to Moscow, this report probably re-inforced the idea in Moscow that
American protests about Poland and Afghanistan were a governmental sham
without any support in the institutions of the country such as
universities.
We believe that Stanford should adopt a policy toward Soviet
visitors that balances the following considerations:
1. Preserving the orderly functioning of the academic processes of
research, publication and teaching and avoiding the creation of a security
atmosphere.
2. Showing the visitors a society more open than their own.
3. Minimizing transfer of militarily useful technology so as to
minimize our own defense costs; perhaps we can help obviate the need for a
return to the draft. Ways of implementing this without security measures
need study.
4. Increasing reciprocity so that access to Soviet research
becomes available to Americans to the same extent that our research
activities are accessible to them. This involves some degree of support
to the bargaining efforts on our behalf conducted by the State Department
and the National Academy of Sciences.
5. Maintaining good relations with the State Department, the
Defense Department and other Government agencies.
Since these goals are not entirely co-incident, some degree of
compromise is needed.
We suggest that a committee be appointed to develop a policy. If
an interim statement clarifying the impression given by the Stanford press
release could be made, it might help mitigate the unfortunate signal that
has been sent to Moscow.
∂31-Jan-82 1925 JMC
To: TOB
The current version of the statement is page 3 of STATE[W82,JMC].
∂31-Jan-82 1952 JMC
To: FFL
Please scribe STATE[F82,JMC] after centering the title, etc.
∂01-Feb-82 2320 JMC
To: INGALLS at PARC-MAXC
Nothing was distributed. I don't know how the department feels about
free loaders. The instructor, Antonio Porto, is AP@SU-AI.
∂01-Feb-82 2322 JMC
To: admin.mrc at SU-SCORE
Here are the files that should be put on the disk. OLDPROLOG should be the
file accessed as prolog. There are two copies of each file on the tape
just to be sure.
∂01-Feb-82 2316 David Warren <WARREN at SRI-AI> Tape Listing Itself
Date: 1 Feb 1982 1724-PST
From: David Warren <WARREN at SRI-AI>
Subject: Tape Listing Itself
To: JMC at SU-AI
DUMPER tape # 1, documentation, Monday, 1-Feb-82 1649
file last write size (pages) checksum
<PROLOG>READ.ME.2 12-Jul-81 2045 1
<PROLOG>PROLOG.DOC.1 12-Jul-81 2037 58
<PROLOG>GUIDE3.MEM.1 12-Jul-81 2036 36
<PROLOG>DEBUG.MEM.1 12-Jul-81 2036 22
<PROLOG>PROLOG.HLP.1 12-Jul-81 2039 1
<PROLOG>TUTORI.LPT.1 12-Jul-81 2045 8
<PROLOG>TUTORI.PL.1 12-Jul-81 2045 3
DUMPER tape # 1, oldprolog, Monday, 1-Feb-82 1650
file last write size (pages) checksum
<WARREN>PROLOG.EXE.26 31-Oct-81 1050 118
DUMPER tape # 1, newprolog, Monday, 1-Feb-82 1651
file last write size (pages) checksum
<PROLOG>PROLOG.EXE.1 12-Jul-81 2037 115
<PROLOG>PROLOG.EXE.26 16-Dec-81 0908 116
<PROLOG>PROLOG.EXE.28 21-Dec-81 1615 116
DUMPER tape # 1, documentation1, Monday, 1-Feb-82 1652
file last write size (pages) checksum
<PROLOG>READ.ME.2 12-Jul-81 2045 1
<PROLOG>PROLOG.DOC.1 12-Jul-81 2037 58
<PROLOG>GUIDE3.MEM.1 12-Jul-81 2036 36
<PROLOG>DEBUG.MEM.1 12-Jul-81 2036 22
<PROLOG>PROLOG.HLP.1 12-Jul-81 2039 1
<PROLOG>TUTORI.LPT.1 12-Jul-81 2045 8
<PROLOG>TUTORI.PL.1 12-Jul-81 2045 3
DUMPER tape # 1, oldprolog1, Monday, 1-Feb-82 1652
file last write size (pages) checksum
<WARREN>PROLOG.EXE.26 31-Oct-81 1050 118
DUMPER tape # 1, newprolog1, Monday, 1-Feb-82 1653
file last write size (pages) checksum
<PROLOG>PROLOG.EXE.1 12-Jul-81 2037 115
<PROLOG>PROLOG.EXE.26 16-Dec-81 0908 116
<PROLOG>PROLOG.EXE.28 21-Dec-81 1615 116
End of tape.
!
-------
∂01-Feb-82 2325 JMC
To: oppen at PARC-MAXC
Sorry. What set it off was that my secretary was asked by someone how to
find you, and I sent you a message without thinking about looking at
a PLAN file.
∂01-Feb-82 2329 JMC Tops-20 Prolog Tape
To: admin.mrc at SU-SCORE
∂01-Feb-82 2316 David Warren <WARREN at SRI-AI> Tops-20 Prolog Tape
Date: 1 Feb 1982 1722-PST
From: David Warren <WARREN at SRI-AI>
Subject: Tops-20 Prolog Tape
To: JMC at SU-AI
cc: Warren at SRI-AI
John, The listing of the tape will be in the following message.
Basically, you need the PROLOG.EXE from the save set "oldprolog"
for a reliable version. This version, however, only allows
Tops-10 style filenames. The version of PROLOG.EXE.28 in the
save set "newprolog" is the very latest version which permits
full Tops-20 filenames but which has a number of (minor) bugs
and snags. The first save set, "documentation", contains all
the current documentation. The tape contains a duplicate
copy of each savE set for good Measure. A catalog of the
various files follows. -- David.
; Fileq needed to use DEC-20 Prolog (see READ.ME):
<WARREN>PROLOG.EXE ; Prolog interpreTer + compiler
<PROLOG>READ.ME ; Fuller description oF these files
PROLOG.DOC ; User's Guide¬
GUIDA3.MEM↓; Guide to Version 3
DEBUG.MEM∩v↓∂kSI∀Ai↑A⊃KEkO≥S]NA→CGSY%iSKf4∀@@@@@@AA%∨→∨≤Y⊃ $rA!e=YP∨≥∧C↔3A∧3'3∀hQ↓↓↓α↓↓↓α%*R>JJr2BPKYαO#⎇∪QβS,εF␈⊗≤≥Bε}d
πε}MxphR∧∧ααα∧∧¬%-Iz$J@T∪α'P"|0[x62yH33y the Tutorial
-------
0"
Feb-_2 0036 JMA
To: ARK
Dkn't ygu have Kurt↓↔←]←1SGJA1SgiK⊂ACfA5rAiQ∃cSfA¬ImSg∃J}~∀4⊂_≡`d5
KDZ`d@@`Dhh∪∃5ε@@~))↑t@Aβ%⊗@@@~)⊃JASLA[rAQQKgSLACIm%gKJ\4∀~∀_≡`d5
KDZ`d@@`Dhr∪∃5ε@@~))↑t@AW←]=YSOJ↓ChA'I∩[β∩@@@~)⊃←nA≥←KfAQQJAi!KgSf|~∀~∀_≡`d5
KDZ`d@@b@d`∪∃5ε@@~))↑t@AWCr↓ChA!¬%ε[≠¬1ε@~)≥↑AaI←EYK4\A≠←9ICrA¬]HA/∃I]Kg⊃CrACP@bbXf`bA5CeOCIKhA∃¬GWf\4∀~∀_≡`d5
KDZ`d@@b@hp∪∃5ε@@~))↑t@ACgaIKrACPA!β% [≠β1 @@@~)∪hA[∃KifA¬h@bc¬ZA←\↓≠←]I¬sfAC9HA/K⊃]KgI¬sf\@↓
SegPA[KKQS]NA!CfA←
Gkee∃H\~∀4∀_≡`d5
KDZ`d@@bXd`∪∃5ε@@~))↑t@AW←]=YSOJ↓ChA'I∩[β∩@@@~)∨⊗\A%hOf@
KMKI[C\D↓ErAi!JAoCd\@A∩↓]KKH↓i↑Ag∃JAs←TAEKM=eJA∂ICrA)UKgICdX~∃g<A∩AG¬\AgCdAg←[∃iQS]≤A←iQ∃dAiQ¬\X@E!JAgK∃[fAi<AgiS1XAKq%ghDA]QK\AQQKr~)CgVX↓EkhA$AI←\≥hA]K∃HAi↑↓aeKgLAs←j↓eSOQPA]←n8~∀~∀_≡`d5
KDZ`d@@b\bn∪∃5ε@@~))↑t@A
_@@@~)πQKG,AiQCPAoJA¬eJA]<AY←]≥KdAa¬sS]N↓%SGQ¬eHAβ9IKeg=\AoQ<ASfA]SiPA!! L~(~∀ ∂02-Feb-82 1753 JMC
To: JJW, AP
I have moved prolog.dis to 1,ap from 1,jjw.
∂02-Feb-82 1755 JMC
To: "@PROLOG.DIS[1,AP]" at SU-AI
<prolog>prolog enters prolog on SCORE.
∂02-Feb-82 1841 JMC
To: FFL
Please find out if Ms. Meng Lee has applied to CSD for admission to PhD program.
∂02-Feb-82 2054 JMC
To: llw at S1-A
Well, we didn't get to first base with the Vice-provost, who took an
extremely defensive attitude. We'll try the President next.
∂02-Feb-82 2056 JMC
To: RPG
I don't know how great the chances of success are. For example, I
don't know Terry's opinion. Only the names of references need be
gathered.
∂03-Feb-82 1845 JMC sign
To: BS at SU-AI
We need a sign to put on the Xerox machine saying, "Xerox down, IBM and
Kodak have been called.
∂03-Feb-82 2335 JMC
To: pourne at MIT-MC
I think you deserve considerable credit for this result.
a013 2242 03 Feb 82
PM-Space Budget,450
Reagan OKs Planet Program Money
By HOWARD BENEDICT
AP Aerospace Writer
WASHINGTON (AP) - Overriding his fiscal advisers, President Reagan
is proposing in his new budget that much of the U.S. planetary
exploration program be kept alive.
Just three months ago, the Office of Management and Budget
recommended killing most deep space exploration projects in its drive
to cut federal spending.
The effort met strong opposition from scientific organizations and
congressmen on key space committees who took their case to the White
House.
As a result, Reagan has put money for several deep-space projects in
his fiscal 1983 budget. Included is $92.6 million to continue
development of the Jupiter-orbiting Galileo satellite; $21 million to
move ahead with several European nations on a joint sun-probe
mission; and money to maintain the deep space tracking network and to
allow the Voyager 2 spacecraft to travel on to Uranus and Neptune.
If OMB had succeeded in dropping the planetary programs, it would
have meant the loss of about 1,200 jobs at NASA's Jet Propulsion
Laboratory in Pasadena, Calif., which manages the deep-space efforts.
The president is to submit his full 1983 budget to Congress on
Monday. The Associated Press on Wednesday obtained an advance copy of
the National Aeronautics and Space Administration section.
Reagan proposes total NASA spending of $6.6 billion. Factoring in
inflation, that's about equal to 1982's $5.98 billion.
A major share of the 1983 budget, $1.7 billion, is for the manned
space shuttle, which is to complete its test program with flights in
March and July and to start cargo-carrying operational missions in
November. A second shuttle, the Challenger, is to join the Columbia at
Cape Canaveral, Fla., in June.
Another $1.7 billion is earmarked for space flight operations,
mainly for the shuttle.
Reagan is a strong supporter of the reusable spaceship, primarily
because of its potential military applications.
NASA didn't get all it wanted in deep space. It lost a Venus orbiter
and a probe to Halley's comet. Other projects were scaled down or
stretched out. But, considering the bleak outlook a couple months ago,
it came out pretty well.
The proposed budget also includes $137.5 million, $61.7 million and
$34.5 million, respectively, for continued development of three major
orbiting satellites: a space telescope, an advanced Landsat Earth
Resources payload and a gamma ray observatory; $100 million for
construction of facilities; and $1.17 billion for research and program
management.
Aeronautical research dipped slightly, from $233 million in 1982, to
$232 million. Heaviest cuts were in technology for transport aircraft
and advanced propulsion.
The budget projects total NASA employment of 21,219 by the Sept. 30,
1983, the end of fiscal 1983. This would be a drop of more than 400
from the projected 1982 figure of 21,652.
ap-ny-02-04 0137EST
***************
∂03-Feb-82 2355 JMC
To: FFL
umnov[w82,jmc] needs moving the @newpage and scribing.
∂04-Feb-82 0157 JMC
To: RPG
Do you have an opinion of the 3 garbage collection papers?
∂04-Feb-82 1025 JMC
To: asprey at PARC-MAXC
If you know something or will do some reading, it may be
worthwhile to come. The class is in 301 Margaret Jacks Hall.
∂04-Feb-82 1032 JMC
To: csd.armer at SU-SCORE
Bolles is at SRI, Cartwright is at Rice and Wagner is at Intel.
Put me on your mailing list as JMC@SAIL, although mail addressed
as you did is automatically forwarded.
04-Feb-82 1511↓JMA
To: TOB@@@~)/CYX0A∩AgαK∂/↔ βS#∃ε;Weβ|qβg∨αUbα¬
zW⊗v]IF*b∞⎇εzπ> vw≡},V"πM Rεn\X
≥Ykβ!-<h_$∞≤[s
≤Z8h ≥Yλ⊂≠Yv6⊂%[7{w≤βcience f@%GiS←8AoeSQKd\@↓⊃JAQ¬fACYM↑~∃oISiiK8A←\A⊃KMK]MJAa←1SGbX↓KiF\↓S\AGα{3 &≤-w⊗∂M→vrπ⎇~FBε∀λ M}h≤Y.M<Y9↓QR≠snl<H⊂_≤7s2i\wy↔λ$2P4\β also a Republican poliTician. Hiq CiTizen's
Adviso@IrAπ←U]GSX↓←\A'ACGJAA←YSGdXAS\↓oQSG A∩AQ¬mJAi¬WK\AACehX↓iP∨∨/##↔HhS←'SBβS#∃∧a5Uβ≡{∂'↔'I1β∪/≠↔K[/→β¬β>{?⊃βε KQβ|1βS#*β∂K↔&KQβ≠|ε"¬⊗\≤v∞r|1PV&\8
.≥9{K∧∞Y<≠n∞→9
L<⎇
m9z≥¬D≥≠h∞<=Y(∞M→(≤
L9Y5 ≡↑(≤∞-y|X-T≠yH h4p#! 9x:-n⎇λ∀nMxz{,≥I|h ≤≥Z8lUKHλ ≥H→y-l<X;¬D∩(∃
;Z`
⎇<[L]≠→)n4→;] ↑\≤Z.<<kβ!.z~8m∧~;]M⎇≥Y( -⎇~λ∞<z9;NM<⎇≤d ;Yλ∞>_8y$ X;\eD_<Y$∞⎇<\∞-<z;L⎇≡(⊃,lY8⎇
≡Y+C!)=λ∃m};→λ ,(≥{n.~≥z
≥→(→M}H≡;nT≥≠h Mh≤{m\(≥~
≥Zz;Lt_8[n↑λ≤[l-⎇~8n∀~;C!.|_8lUHλ⊃/ y<∃∧∞~_=∧ (≥z-Mλ_Y$
;H⊃N,9Xy%D∩(∃m};→λ
=Y( ≤xy4∞L9λ≥
#"R-nZ=_.M;{H
←<y3 eC"C! ↓Al
(l8K.ε$λ -F&α2S(4λβ"JMnHλ∧ \x{nNλ_=∧
u+4h9tQ(∧∧λβ"I∀→⎇9.>h∩(
l99λ∞Mh~{M}h≥~ T_;;n]]≤h∞ :9λ∞Mh≥~ T→~9Ll<Y;ND≤→;n
→+H∧ (→~,MI⎇β!.Y8;
∨Y(≥
=λ∩$∞x<h∞ :9λ ≡λ_;
D≠{H∞M→(_m⎇]≤X,> C"AQ@↓Al
(l8K.ε$λ Lf&"2S(4λβ"JMnHλ∧ 34h∧∧λβ"IM<⎇≤d
yH→
}≥→9∧∞_:<N4_<Y$∞z_=∧∞x<h
≥]→;LL9 C!!"@↓Al
+(l8K.ε$λ ε6B2S(4λβ"JMnHλ∧
∪pH ≡λ∀u%X2#"H8nHλ∧ |y L⎇{≥8D =λ∀jU4psj((β"I∀≥~~-mh≥~ ↑Y(~.4_(≠L\9λ→M}HλXn-=~8l≥λ≠8.>hH≠mm≡(~-d_(→L↑h_<L\<kH∧λ;≤{aQ]~→$ 9~]-l⎇λ→L≤⎇;≥∂∀~;H
L;Y⎇,≤y(≥m≥≠λ_LT~]<nM≡(≠llY;Y \λ_↑$∂;⎇<D
:<z-lt they are mainly native speakers - they aren't. At least the
adjunct professor in charge of teaching French has a non-French name
and is the author of a series of textbooks.
∂05-Feb-82 0959 JMC
To: FFL
I'm going to Livermore today.
∂05-Feb-82 1719 JMC
To: JJW
CC: ZM
I will in Europe in April and May, but I don't have to be present.
Alternatively, the exam could be postponed till Zohar returns again,
which I believe is in September.
∂06-Feb-82 2340 JMC
To: CLT
Please look at BOYER[W82,JMC]. It requires extension and improvement.
∂07-Feb-82 0223 JMC
To: morris at PARC-MAXC
Can you send me a copy of your "Real programming in functional languages?
∂07-Feb-82 1047 JMC
To: CLT
Sorry.
∂07-Feb-82 2302 JMC
To: feigenbaum at SUMEX-AIM, pratt at SHASTA
In reply to Ed's question about the M8l60.
It doesn't find data as quickly as a disk, since it has to spin tape,
but of course it can provide very large file backup. I fear it's too
expensive for us, but it would certainly be nice to have in the long
run. In any case, it's best to postpone serious discussion till we have
our money.
∂08-Feb-82 0111 JMC
To: REM
I suggest you send this message to RPG who is the MACLISP guru here.
∂09-Feb-82 0404 JMC
To: gxg at SRI-KL
An account for Herbert Stoyan has been created. The account name
is HST (account names cannoT havE more than three letters), and
the pasSword is the one requested.
∂09-Feb-82 0404 JMC account for Herbert Stoyan
To: FFL
I have created a login for him with the name HST. Please get it entered
in the records as a minimal guest account. His address etc. is in my
PHON file.
∂09-Feb-82 0407 JMC
To: FFL
Also please mail him "Short Waits" and "Essential E".
∂09-Feb-82 0408 JMC Stoyan account
To: GXG
An account has been created for Herbert Stoyan with the name HST (account
names cannot exceed 3 letters) and with the password requested. I have
arranged for him to be sent "Short Waits" and "Essential E".
∂09-Feb-82 0410 JMC
To: FFL
The note to Stoyan should mention that his account name is HST.
∂09-Feb-82 0944 JMC
To: FFL
A guest account.
∂09-Feb-82 1149 JMC
To: ullman at DIABLO
I'll do it if you like, but ...
∂09-Feb-82 1150 JMC consulting bill
To: pjb at S1-A
Is it correct that I bill for travel between Stanford and LLL? If so,
what is the standard mileage and rate?
∂10-Feb-82 2345 JMC
To: HST
The following two files contain some comments on your translation.
Maybe I'll have further comments later, but I've delayed so long, that
I'd better pass the papers on to Luckham now.
stoyan.6[let,jmc] comments on 2nd part of Stoyan's translation
stoyan[f81,jmc] comments on 1st part of Stoyan's translation
∂11-Feb-82 1512 JMC
To: FFL
CERCON.1
∂11-Feb-82 1704 JMC
To: RPG
I suggest you offer the following as references, suitably combining people
who will give good references and those who will be asked anyway.
David Waltz (Univ of Illinois)!
Terry Winograd (Stanford)?
John McCarthy (Stanford)?
Guy L. Steele Jr (CMU)!
Lowell Wood (LLL)!
Nils J. Nilsson (SRI)!
∂12-Feb-82 1327 JMC
To: CLT
San Jose - Armenian
The Armenian Gourmet 408 732-3910
921 E. Duane, Sunnyvale
Hours: lunch M-F 11:30-1:30, dinner W-Sat 5:00-8:30; closed Sun;
accepts MC, Visa.
Good Armenian cuisine at very reasonable prices; somewhat homey
atmosphere. Try the excellent lamb and beef saute. Good hummus, too
[BVM-9/78].
∂12-Feb-82 1455 JMC guest account for Martin Davis
To: FFL
I have created an account MDD for him. Please fill out the form for
him. His address is in PHON.
∂12-Feb-82 1457 JMC account
To: davism.acf1 at NYU
The name is MDD and the initial password is PRIZE. You can change
the password if you want to.
∂12-Feb-82 2001 JMC message files
To: ME
Is it normal for someone coming from utexas-20 to be logged into
the message file area?
∂14-Feb-82 0119 JMC
To: FFL
naraya.1
∂14-Feb-82 1326 JMC
To: REM
Both would be good, but I supposet the .xgp to .pre is more urgent.
∂14-Feb-82 1328 JMC
To: FFL
How is the spindling coming? A purge is threatened.
∂14-Feb-82 1344 JMC
To: CLT
Yes. I was merely restless. By the way, see TUNER[1,JMC].
∂14-Feb-82 1659 JMC
To: csd.ullman at SU-SCORE
I suggest you phone Kahn about proposal.
∂14-Feb-82 2039 JMC
To: JMM
Lets get together tomorrow to finish off the grades for the NRO CS206.
14-Feb-82 2055 JMC
To: pjb at S1-A
I actually took a third @I←kiJ↓ErAQ%KQoCd@dfn↓oQSG A∩AgUaa←g∀ASf@T`~∃[%YKf\AβfAQ↑AiQ∀AICi∃fA←L↓[rAgU[[Kd↓ieCm∃XXA∩↓iQS],AShAβ;?W3 β ∃β⊗+OP4W#=β7∞[∃β'"βS#∃β Iβ∪∂KMβ≠|ε"π>
_6BπM WJπ ≥⊗"ε\Ubα∧≡4πN␈T
V∂J∞,V≡∞MEB∧HQ*F}fD ⊗␈*∞Mε∂"∞Mε/J
zf/∩∞ ⊗N"
\Rbπ=t∧Jπ⎇}&N.D
v62∞Mε*ε←∞G⊗
L↔O~ NW⊗NlqPW& T∧6∞MEBε↔↑D∧JεM⎇b?"∞|⊗w"∞Mrε␈l↑&f↑≤Dπ&FT ⊗≡≡}]g&Nltπ∨O>LVjR∧ ↔"π<\Vo_Q.Fzε\Tπ&F≡DεoJ m↔↔∨D F∂J∞|↔~¬<↑π&.\,W∩β&∀ε∞vD v␈"∞ ⊗N" mw∩πM Rεv←∞Bβ !Q'>␈-=⊗v: L↔O~d∧¬&F≥m7~ε≥dε∞'l≥f≡* mw∩π≥}W∩ε\lf␈↔N4π&z
\⊗↑*
≡Bε∞MDε≡}\QPV␈↑Dε/6]e`hPQ `{⊗ET6.%Wβ∩αε&∪+→)T~α↓Q%&{$∧α∧4iDααα↓Q&n≡<≡'"s⊃Q hP ∂15-Feb-82 0128 JMC
To: REM
Not that I know of.
∂15-Feb-82 1351 JMC
To: ME
Would it be difficult to modify Xpo so that one option would be to dover
or xgp the file whose name was found?
∂16-Feb-82 1128 JMC Davis address
To: FFL
We'll need to look further. Aha! He has applied for a professorship
in the Department. Irmgild will have his correct address, which should
be entered in PHON.
∂16-Feb-82 2118 JMC
To: HST
The computer has been sick in the last few days. It's usually more reliable.
∂17-Feb-82 0047 JMC
To: RPG
Late tomorrow afternoon would be a good time.
∂17-Feb-82 0103 JMC
To: ME
What is a .spi file?
∂17-Feb-82 0138 JMC
To: pourne at MIT-MC
Thanks for the quote.
∂17-Feb-82 0145 JMC
To: pourne at MIT-MC
CC: llw at S1-A
Somehow I missed your previous message. A conference call is ok with
me if it's ok with Lowell. Somehow I think we haven't done enough work
yet, but if your friends won't be put off by a preliminary discussion,
that's fine with me. Have you reached Lowell or should I try.
After noon or evening is fine with me for call.
∂17-Feb-82 0149 JMC
To: ME
There were three in 1,jmc. I deleted them, but then got curious and
restored two. They have some random characters (images of control chars
I suppose) and REM. Have a look if you like. They're unprotected.
I thought they might have something to do with SPYing.
∂17-Feb-82 0155 JMC
To: pourne at MIT-MC
CC: llw at S1-A
I have no objection to your exploring the matter discreetly as you are
planning to do. Lowell may have more information for you.
∂17-Feb-82 0241 JMC
To: ME
Now I know. They're spindle files.
∂17-Feb-82 0307 JMC
To: FFL
Can you find a paper by Alan Pasternak on reducing dependence on imported oil?
∂17-Feb-82 0312 JMC
To: JPM
Let's talk about your SAIL account some pm.
∂17-Feb-82 0348 JMC film in space
To: pourne at MIT-MC
Is anyone planning to make a feature film set in low earth orbit and
with at least part of it shot in low earth orbit?
∂17-Feb-82 0350 JMC
To: pourne at MIT-MC
It needs a suitable story, of course?
∂17-Feb-82 1553 JMC
To: AP
states.pr[e81,jmc]
∂18-Feb-82 1841 JMC
To: CLT
Sten-Ake says you should resend your message to Ken Kahn.
∂18-Feb-82 2241 JMC
To: chandrasekaran at RUTGERS
I have discussed the prospects once with Dr. Teller, and we have to talk
again. Incidentally, I have been looking at the EPRI Journal and noted
Simulation Methods for Nuclear Power Systems.
WS-81-212, $32.00
"This report constitutes the proceedings of a conference on nuclear power
plant simulation that was sponsored by NRC and EPRI in Tucson, Arizona in
January 1981. Papers from government, industry, natuional laboratories,
and universities are presented; the topics covered include simulation
needs, simulator design and performance, engineering simulations,
model development methods and verification. EPRI Project Manager
P.G. Bailey
Electric Power Research Institute, P. O. Box 10412, Palo Alto,
CA 94303.
It seems to me that your efforts to get funding would meet greater
success if your proposals mentioned such efforts and explained how
your proposals supplemented what was being done. Second, it occurs
to me that EPRI is a possible source of funding.
∂18-Feb-82 2309 JMC more on simulation
To: chandrasekaran at RUTGERS
I talked with Jerry Tiemann from General Electric, Schenectady, who
told me that he didn't know of simulations being used or proposed
in an operating environment, but he didn't claim to know much. He
asked for your name, which I gave, but I suspect you're more likely
to hear from him about his efforts to recruit PhDs than about giving
your project support.
∂20-Feb-82 1432 JMC
To: FFL
meltze.1
∂20-Feb-82 1432 JMC disjunctive knowledge
To: bmoore at SRI-AI
As you pointed out in your Master's thesis, ascribing world models
to people doesn't properly represent knowledge of disjunction.
1. Did this criticism apply also to the work of Schank and Abelson?
2. Are the formalisms generally used in AI today (not referring
to your own) adequate in this respect?
I'm replying to a letter from Bernard Meltzer citicizing my "First order
theories of individual concepts and propositions" and claiming that
Schank and Abelson solve all problems. Well he doesn't actually say that.
∂20-Feb-82 1521 JMC commute mileage for consultant
To: pjb at S1-A
I just received Livermore check 046842 for 270.00 labelled
"compute mileage for consultant". If I don't hear otherwise,
I will assume it is for my summer travel when I wasn't strictly
speaking a consultant but a summer employee. Otherwise, there is
a mistake since I have submitted only one consultant bill.
∂20-Feb-82 1603 JMC
To: FFL
scienc.1
∂20-Feb-82 1629 JMC
To: FFL
yamada.2
∂20-Feb-82 1634 JMC
To: FFL
kowals.4
∂20-Feb-82 1657 JMC letter for Teller
To: FFL
CHANDR.RE1 is a draft letter for Dr. Teller to modify and send if he
chooses. It doesn't need to be SCRIBED, but should be printed neatly.
It needs Chandrasekaran's initials in the beginning and his complete
address as the last sentence.
∂20-Feb-82 1718 JMC
To: FFL
marcon.1
∂20-Feb-82 1835 JMC
To: CLT
To print on canon ordinary, i.e. non press, files, incant as follows:
r makimp
[This asks for a file name and converts the file to .imp form].
then
do cprint[can,sys]
[There are sometimes mysterious failure messages].
∂20-Feb-82 2142 JMC
To: RPG
Come to think of it I won't be in Mon or Wed but will be in Tues.
∂20-Feb-82 2148 JMC iii trips Monday and Wednesday
To: CLT, FFL
I go to L.A. Monday (Feb 22) morning returning monday afternoon
and likewise Wednesday morning returning wednesday afternoon.
∂20-Feb-82 2154 JMC L.A. trip
To: CLT
The Monday meeting is Monday rather than Tuesday so I can meet my class.
I have nothing to do in L.A., and I don't mind the trips, and I want to
hear about Boyer and Moore.
∂20-Feb-82 2214 JMC
To: CLT
Mho! WelL, most programs aren't testedsufficiently with input where
they aren't expected to succeed. I suppose there may be simidar
weaknesses in EKL and FOL. For example, FOL was working for ayaar
kr Two bedkre I made it do Russel@0OfAa¬eCI←`Xλ4(hP0 ;&∃T6.%Sβ∩αεεββ8→)T
α↓Q%&{$∧αε∨<Af>}N\"ε∂D
5*m89u∀*↓Q$Jε
x T≡;⎇$∞Y89∧
z_<
≡XπSyH42z:→y⊂:7H9rrP~8yz⊂~7{P0[q0r4[zyP4→P4yWλ$P40Y⊂37`2eotten.
λ ∂21-Feb-82 0105 JMC
To: FFL
shapir.>
λ∞db5
KDZ`d@@`Djn∪∃5ε@@~))↑t@Aβ ~)∩OYX↓[Sgf↓s←kd↓GYCgβ→α7?v#πeβ∞s⊃α←.#;↔O& e9αJβ7WO"β ∃βL¬b∧f}4∧∞v|]F/~ -w&B L↔O~βC"AQ@↓AβY_VQ2q⊗\ ⊂⊂_Z ≤@e&PP⊂εE∃7]⊂⊂λ)(#@λ⊂⊂εE∩q⊂<w]P57d[⊂:42H30qz[:8 , you'll have to change qour PLAN.
λ ∂22-Feb-82 0041 JMC
To: FFL
I need to find the Stoqan papers and pass them on to Dave Luckham.
∂22-Feb-82 0403 JMC
To: FFL
Please scribe-decorate Shapiro letter, but I'll revise it some more.
∂23-Feb-82 1644 JMC
To: FFL
wang.1
23-Feb-82 2246 JMC
To: FFL
bloom.1 is a letper thatrefers to energy.detYw82,jmc]. Please scpibe both.
¬
∂24-Feb-82 0043 JMC
To: TOB at SU-AI, feigenbaum at SUMEX-AIM
Partly against my better judgment, I have allowed myself to
be interviewed by the Stanford Daily. I don't think I said much
wrong, and the reporter called me to check, but I still can't be
sure how it will come out. I suppose my main motivation was that
I had better let something happen, since I have been prevented by
other matters from taking any action along the lines we previously
discussed.
I told the Daily reporter to call the rest of you who
took part in the meeting with Dean Lieberman, but, of course, I
can't be sure that he will do so.
Here's hoping it turns out all right.
Sincerely,
∂24-Feb-82 0044 JMC
To: FFL
Please print FLORY.1 and take it to chemistry department.
∂25-Feb-82 1110 JMC
To: csd.armer at SU-SCORE
In the past this has been settled by the Department Chairman or Denny
together with the individual faculty members. Next year as usual, I
will have 50 percent support and propose to teach two courses, CS206
in the Fall and CS226 in the Winter. I alternate CS226 (Epistemology
of AI) and CS258 (mathemtical theory of computation) in alternate years.
Since a given faculty member doesn't always teach in the same area, I
don't see how your scheme is practical. It would be better if you or
Gene spoke individually to the faculty members. I have no idea whom
your are expecting me to call to a meeting.
∂25-Feb-82 1421 JMC
To: konolige at SRI-AI
The following variant of this puzzle that does not require an initial bound
on the numbers was given in Martin Gardner's Mathematical Games column
in %2Scientific American%1, 1980 June:
S: I see no way you can determine my sum.
P(after a delay): That didn't help me. I still don't know the sum.
S(after delay): Now I know the product.
Assuming the Goldbach conjecture, the numbers must be 5 and 6.
- due to Barry Wolk, University of Manitoba
∂25-Feb-82 1430 JMC Kuck paper
To: bobrow at PARC-MAXC
The first page is badly reproduced. Can you send me another copy of it?
∂25-Feb-82 1743 JMC
To: AP
fred.pr[e81,jmc]
∂25-Feb-82 1748 JMC
To: feigenbaum at SUMEX-AIM, csd.ullman at SU-SCORE
CC: csd.armer at SU-SCORE
Next year I plan to teach CS206 (Recursive programming and proving) in
Fall and CS226 (Epistemological problems of artificial intelligence) if
Winter and nothing in SpRing (using 50% suppopp). Should this oFfer Any
problems fop planning the AI oFferings or the systems offerines (assuming
CS206 to fall under systems), please let me know.
∂25-Feb-82 1751 JMC
To: RWW
CC: FFL
Traditionally, graduate students get zapped effective the end of
a quarter, and I suppose you mean to zap Kasturia at the end of
Winter quarter.
∂25-Feb-82 1753 JMC
To: RWW
CC: FFL
Come to think of it, I guess RA's are rarely zapped except at the end of an
academic year. Perhaps you should discuss earlier zapping of Kasturia
with Gene or postpone his zapping till end of Spring.
∂25-Feb-82 2122 JMC
To: perlis.ee at UDEL-RELAY
The Department is looking for people, and I will refer your resume to
Professor Golub, the Department Chairman, when iT comes. I will write
you if I have a definite reaction to the reprints.
∂25-Feb-82 2123 JMC
To: RWW
From your last two messages, it seems to me that you know what you are doing
and have consulted sufficiently with the authorities.
∂26-Feb-82 0016 JMC
To: HST
There was a Richard Watson at SRI, but he left to work for some
company, maybe an oil company. I don't think he had any relation
to LISP, but he may have had some relation to the chemical structural
questions which dendral tackles. I believe he wrote a book on
time-sharing some time in the sixties. Of course, it may be a
different Richard Watson, so you had better be sure it's the same
one. I think perhaps he was in the Computer Science Department
at Stanford for a year or two.
∂26-Feb-82 1202 JMC
To: csd.irmgild at SU-SCORE
I certainly want to talk to Shapiro. Late afternoon Thursday is best for me.
λ∞dl5
KDZ`d@@bLfn∪∃5ε@@~))↑t@Aπ→(@@@~)←VXAαc↔Q∨~β∪=βO!04(hP0-I2j≠↔ kAI↓↓ 1M\&Tj
↓hRS=iα↓β∂O"s+π/*βπQα≥)6N∞⎇∩∃↓hRK↔O≡k↔g↔∩aαK?>+H%E∪→Aα∨⊗ ;Qα∂3∃9↓≠)]Pε≡ 9α≠⊗ ;∂'≡≠=1α≤ ↓eQ →L84PH'C#␈#?∨K∂β#↔I¬;#=β&{?-αuJQβCN≠SWK/→β∪↔~↓Eeaαa↓eU2iEIA(h(4(0=I:j≠↔ kAI↓↓ )MX&Tj
↓hRS=iα↓β33:βπQα≠ 6¬hRg?W∩βC↔π≥#'?9π#=α⊗e~ε2Zβ:sC∩I)T≥j∞⎇w.fDλ&*π|]F≡}\U`hPQ `{&uT6.%Wβ∩αε⊗s+H→)T~α↓Q%&{$∧α¬LQQ$O"∞⎇⊗fb ,Rε␈ ]bbε≥lBεOD∞vNfD &*ε≥mf␈.l<V"r∧ ∩ε⊗]M⊗/6T
↔"π⎇≥Fbε,TεNpQ(f.N|]f⊗∂]Tw~¬9_te,h9αph!Q ∂28-Feb-82 1433 JMC
To: JMM
I have finished the exams. Let's go through the grading algorithm.
∂28-Feb-82 1820 JMC Hayes quote
To: csd.smith at SU-SCORE
What is the precise reference of "the way to control reasoning is to reason
about control"?
∂28-Feb-82 1832 JMC Wolfram
To: csd.golub at SU-SCORE
I have looked briefly at the SMP manual. It is rather poorly organized.
On the basis of looking at it, and having heard his lecture, I
see no reason to disagree with Tony Hearn's coNclusion that it's another
algebraic computation system. I would not offer SLAC an enthusiastic
reaction but would offer him a courtesy appointment if SLAC appoints him.
My advice to them would be that tenure is grossly premature.
28-Feb-82 1848 JMC
To: FFL
bean.1 and yofits.1
λ∞`B5≠CdZβAI↓↓β→A@&Tj~α↓→V/&∃\6}>m~FN}g$π⊗.≡9vvNlpλ ≤Yy5∧
{[umL9→y$∧λβ"JMnHλ∧ |yβML9X=∧ =λ∀jU4psj((β"I∀≥_:lT~=λ∞M_=⊂≡wzy_ww:9~q:z4[w⊂:7H:44iH80x %p∧AoCLAiQJ↓←IHAαsW7 -∪↔⊂4Uβπ>↑72ε∂Dλ \<⎇λ∞M~<h
≡h_;
D⊂(⊂→→qrt`6ed. Could yo`*↓cC]Hαβ7* ⊂ε .Y<z↓QX{|∂↔hλ∃
(≠p∩→⊂80sYyP9bYvP4`.triguing.
01-Mar-_2 1156↓JMC
To: pratt at↓'⊃β'Qα@@~))↑Ai∃YP⊃β&C∃βS↔+S!1∧Iβ∪?r;QβO,)βS#*β'7C⎇∪Qβ?2βS#∃ε≠πS↔>{K'k∂#'?9ε+'S#/⊃04 ∞s⊃β←*β∪'∪r;Qβ#∂3∃βO,≠!β¬∧∧f␈⊗\≥Bε≡≤LV>␈-∨&∂&≥⎇bππ,↑fN␈↑=GJR∧ ∩π∨↑>ε.∨AQ&O"}4εn∂,YGJε≥dε∂↔M≤f∞∨D
v $∀_=-D⊂<[,↑Ix P≤2z0t[4s3@ the Task Od∧AIK
SIS]≤~∃oQ¬hAG←β+CO↔~βπK∃∧εFzε,Tε ==Y0↔λ72|:λ<rpy α The co@UagJAMKCKf↓YS@/*βπ9β∞#[πl8 ,A ¬7g→T⊂0w→⊂:42\2s7`2e should @ JAoQ¬iKmKβ⊃βg∨αTε&.=_F*@Hλ∃m
;→(∞M→(⊂∩[2rr`.tar`24⊂ ∂?/∪G/4 f..Dλ
t_Y( M=≥→,D≥≠yl↑~→0→ ⊂0r;_w1rbλ1wri≤p¬s Shoul@⊂AEJA¬hAiQ∀~∃ISMGeKi%←\A←α1βC#*βCK?4∧W>{xCAQ@εEβ∧π0!
Mar-`d@@bHdp∪∃5α@@~))↑t@AgCEIK\ACPA'%∩5β∩@~)+]M←Iic@;∂#↔3@∀ ∩π>≥H ∧ Y(_,.[x9∧ \[s$∞~→( ]Yλ∪l@⊂
arch tilhλAC ←khAβ##∀∀S⊃C@&∧ v $∩Y0↔→V⊂0w→⊂ P #an'dthink h∂LA¬]s@?v)β↔∪≤∧Rπ>
tπ>␈]HBε⊗Tλ
-n→<Y.>→9↔βE$s⊂≤t2P 7ill stidl be i@8AiQJ↓*U&\↓C@≠S,ε"∧W]lRβ∪¬D∧JπM
⊗vZ∞|Rε≡}]F"π ∨⊂hW ≡'"ε|dπ&FTλWGε]n6/~aQ hP`@lλk)\<K ≤ ⊂⊂_ZM≠e&PP⊂εE∃7]⊂⊂λ!#&⊂λ⊂⊂εE~7s9z α1,hirsch8b~∀~(_≡`f5≠CdZβAI↓↓ )UD&Tj
↓hRS=iα↓α~~b↓↓↓hSCW εK+∂πJsK↔B↑1]U3Vk∞uβ∞s⊃β'v≠3G∪*β'Qβ>KS!βf+SS↔∩βS=αFKKO∂@p4(4P0=A~j7πIkAI↓↓ 9A@&Tj
↓L≠?77}qα2&≥↓β∪'≡≠WOON{9↓hRS=iα↓αJB:↓↓↓the
Common Lisp discussion messages. It would then be convenient for me
to check it with CKSUM rather than have them in my already large general
mail file. If it were feasible, then it might also be feasible for
several people as SAIL to share the same discussion file.
∂03-Mar-82 1812 JMC
To: RPG
Yes. Please take me off the list.
∂05-Mar-82 0112 JMC
To: cl.moore at UTEXAS-20, cl.boyer at UTEXAS-20
I forgot to answer your request for a syllabus of my course in
mathematical theory of computation. Anyway there is, alas, no
syllabus. However, covered the following:
1. representation of recursive programs by sentences in first order
logic
2. A Scott axiomatization of typed lambda calculus. (1969 CUCH, ISWIM and
OWHY paper - not the models of lambda calculus that came later.
3. Use of Ketonen's EKL interactive theorem prover.
4. The Boyer-Moore system. Because of problems in getting enough
disk space and some laziness, both on my part and on the students'
part, they never got to run any problems on the computer.
5. My Elephant formalism for representing sequential programs as
sentences in first order logic.
6. Manna's method (his PhD thesis) for proving total correctness.
7. Axiomatization of flow charts by sentences of first order logic
(multiple entries and exits).
8. Formalization of dirty LISP, including rplaca s and imbedded
setq s.
This doesn't amount to a syllabus, because I don't assert that this
is what should be covered, and it may not represent what I'll do
next month in Marseille op what I'll do when I teach the course again
in two years.
λ∞`J5≠CdZβAI↓↓β E@&Tj~α↓Q%&[$∧αε∨<@ N|9~y.∧_9⊂∀hViaSβRE
U` K]%]NAe∃iC@/L¬f 4≥~→$
αz1P≤zpv⊂~0yP!→ps⊂*[:4v⊂⊗4πhar a`≥Hαα%βπ⊗)β+↔G 4+ |εFBε≥`λ∞Mβ{w - probablY if September.
λ
λ∞`J5≠CdZβAI↓↓β→E`&Tj~α↓_FNvlX D∞z=~∧λ:≥9∧
z_<
≡Yc"JMnHλ∧ |yβL\8π2`3erthat SU-SCORE(λAGβ≠⊃;∪,sπQβ∂!αNUm~∞.J*aαZJαβπQα≥)6ε%`h)↓↓α↓↓β ,∧6F∞βX;D =λ∀jY12β(→3+λ
*uh⊂⊂]⊂)jVPdPεE⊂y2P0[<P7`& yge inteRested in having dinner with him tonight (Briday)?
05-Mar-`d@@bPbdβ∃5α@@~))↑t@AYYn↓ChA&D[α@~))QSf↓SfAB↓IeCMPA←]J↓aCOJ↓eKa←β∪Q9↓∧K⊃β'"β'Mβv{Qβ3N[↔3e∧εFzε,Tπ≡∂M≡6&∞>MwπJAQ'εf\≡6*εLZBεnT
6v␈t
vF∂Dλ
-↑≤[uL]9;]∞∀_<Y$∞Y<=-≡Y9↔βE*42H82y4[p⊂1g]2y2rλ4yP*\⊂:49≠zst \[\Vλ0p∞d↓iQJAAK←aYα)βCπL!βO'>s' π≡ ;P4T 7?Ww#@~ε⎇`π&FTλλm⎇]≤X,>λ≥y.,(⊃Sn <⎇λ0yur]8∧ _A1KfA ¬aP≠↔≥!1α\≡'&Ndλgε@|⎇⊗βE%7d≠⊂ 2`.nessy, Earc @→K a`↔→bαS↔⊃¬βπ;∨5≠'e1∧ @⊗@8;Y
t∀[p∩≤4sr`%z, J@∃H ≠K,π∩¬↔\-⊗p@ ¬0w→⊂ y:~8¬r Samue@0Xλ (!Q'ε/
x NEY≠⊂⊗⊗βw8" h¬P↔∞hJ≠'l≥Bπ⊗↑λ n8∧ f@=` αIIBε≡⎇nG,8⎇⊂≠w⊂)VLFAεEαb:y4[3P:4~yP8 %p¬S@? ∧π&FT
7&∞βYP↔\αd Artifi@
SC@1∧K;@&]H
≤βrw1YP aboratop¬r4Tεv␈⊗αy0∩λ7w⊂&Xw<P \βpec@Q`
β?2βS#∃¬→5Eβ∧ε&}V\8
¬@⊂⊂*4→yrP$[1v2r→rεEεBα1. The f@%` OQ∧ @⊗≡
_
\⎇≥0→→P6pw≥pr⊂ !nd varige@LAMKCQkeKf↓←@→β&C∃βπα,6FOLXλnNαy2P F@
J@∃H ≠K-IαKW⊗K91α&+⊃αC∞s? O←I1α\≡'&Ndλgε@|⎇⊗λ&py1H&2q9≥wαEεBα2. Simul@¬iP∨I∧∧f␈∩λ∧k&∀≠{@⊂∀ ∧P-⊃0, sImudator f@=` αB%↓5EA∧¬vr¬5P %D≤z3.]_9≠n∧¬
fOp∧A3+,ZnA←αqαM∃α⊂αhh)( ,L\Y6$
]8Z-a"C"F5β⊂"2\tsw_w2⊂"→q:ssZw3P7Y⊂(0yXpp @
←[aSαc↔KM∧∧⊗v"
→g&/-\V&N≡LRε@_;Yn\9y4aQXπw the S-1 -
Arthur C@¬[kKX0A
@?⊗+GQα⊗ G/↔'!1απ⊗kπ;∪zαK?∪⊗K∨W↔Ph($ "qα7↔n{@↔J∞8
m≡_z⊂→7y⊂)KXP⊗FB*2r Pa`≥←α3@≡←α#"AQ@∧j4→P92y]v:9P≠pε these Ed¬MOeQ`
βπ⊗)β∂?w#π'lX ∧
9H∃L≡X∧wz\P)V@1 docUm` @;& S'?ph ↔> X LT≥~→/∀~_=LT_Y0∩[⊂6ri→p¬d @]SiPAβ∪↔OWdεG4≠yH \Y[p→≥9P0s≥2y⊂ 4he p@I←UKGβ 4+]x
L\λ→3NM<Y0⊗≡P:7P∪4{2`2more.
~∀%)QKe∀AMOYαc?←Mπ≠?7∃∧#↔SπL¬Bε@yH⊂~~2P9gYαp oCIJAo←β∪ ~πM ↔"ε\∨∩εvβy
=Y#!12r`. i`≥GαcW&\@λ
≥H≠p~~2y⊂ 2eportpεAS]
Y`↔∪(h (*9vn(≤| \z9P∀XP897Yβrams dev@∃YP∨C,∧BεNβXp⊗≥p∧e
U@!¬'ε@Zαβ¬βS⊗ ;O3∂#?Iβ4¬w$→]0⊗≠⊂9z0[20y2λ(0p∪@
CXAi<A*[Gα{∪∃↓F @~εLX l>X8Y,D~;C!:42P∃Tqw`$e do@
k[K]Q0
BuJp4(Q*4m¬T¬R¬*\9v&*∞Mr¬~β(λP_wr2P→βafe@ICi←d8A∪↔6+3/C,!β+?NsS#@∀λλO∀≥~~.∀→x 7]x⊂0w→εA24→P)z0[37y2λ3y7z\⊂42`Y2r⊂!≡P#tgH+trr→y07`,d.¬
λ¬!β'
β_@)∧≠?7CL¬F/∩¬Pε⊗∂<XBε}d
FF*
Z∧
≤4λλm⎇<~0⊗→y⊗⊂ )t translates PASCAL tk
Sta`≥I¬eHA*5G←IJ8~∀4P ∂05-Mar-_2 1419 JMC
To: BS at SU-AI
This is adraft one page repoRt. If it is not likely To be satisfactory,
please let me know what improvements are required.
The period covered is up through 1979, and the people paid significant
amounts on the contract were Forest Baskett, Les Earnest, Martin Frost,
John Hennessy, Marc Lebrun, Ted Panofsky, Armando Rodriguez, Jeffrey Rubin
and Arthur Samuel.
report.lll[w82,jmc] Final report for LLL contract on S-1
*****
During this period the Stanford Artificial Intelligence Laboratory
worked on many aspects of the S-1 project. These included
1. The first architecture manual and various features of the architecture -
Jeffrey Rubin, Ted Panofsky, Martin Frost, Marc Lebrun
2. Simulator for S-1 on PDP-10, simulator for PDP-10 on S-1, simulator
for YUK-7 on S-1 -
Jeffrey Rubin
3. Design and debugging of Pascal compilers and intermediate languages
on the S-1 -
Arthur Samuel, Forest Baskett, Armando Rodriguez
4. Memory switch for S-1 -
Ted Panofsky
The results of these efforts are contained in various S-1 documentation
where they have been merged with results of efforts after the project
moved entirely to Livermore.
There follows some detail of the software work that may not have
been included in other reports include
Some specific programs developed include
UPASC - a translator for full standard Pascal to U-code (as described in
the U-code document[4]).
SOPU - U-code to S-1 code generator. Developed jointly by this group and
the Stanford group headed by Gio Wiederhold.
PASCAL* compiler - based on the UPASC compiler, it translates PASCAL to
standard U-code.
∂05-Mar-82 1424 JMC
To: AP
Antonio Dias 313 994-1200x523 will call again today or Monday.
∂05-Mar-82 1449 JMC
To: csd.smith at SU-SCORE
Thanks for the references.
∂05-Mar-82 1449 JMC reprint
To: FFL
Please send a copy of "Circumscription: A from of non-monotonic reasoning"
to Francoise Harrois
19 Laguna Place
Long Beach, CA 90803
∂07-Mar-_2 1517 JMC Golux
To: PJH
I have just gotten around to reading your 1973 "Computation and Deduction",
some of the contentions of which I am now prepared to agree with. Was
Golux ever programmed or is there a paper that updates the ideas of the
1973 paper?
∂07-Mar-82 1520 JMC
To: PJH
Also, what is the correct bibliographic reference to that paper?
∂08-Mar-82 0131 JMC
To: csd.armer at SU-SCORE
My course listings are as I want them.
∂08-Mar-_2 1814 JMC Hurd invitation
To: REG
Cuthbert Hurd has invited us to eat pie W` I]∃gACr↓Ch@qAZXAC9HAQJ4∃gkO≥KgiK⊂A∩A[∃]iS←8AShAαK⊃α%¬≠↔¬βN{Uβ .3?K∃εC∃βK. ∂#↔~βg?Up↓α#'_h++Wn∪↔IβM→↓aU ¬S Kε⊃`hPQ `@l
)\<K ≤ ⊂⊂_\MZ@e&PP⊂εE∃7]⊂⊂λ5pw2\;0P0]⊂)jfQl⊂
AIM
I don't know about VisiCal; I suppose i@PAgS[AYrAI∃aK]ILA←\A]QKiQ∃d~∃i!KeJA%fABA5CeGKPAM←d↓Sh\@↓∩AI←8OhAW9←nAo!KiQKHAε]∩9(\ASLABAQ∃CYiQd~∃aY¬GJAi<Ao←e,vA∩A]←kYI8OhAQ¬mJACMgk[K⊂Ag↑\A∨LA
←keg∀XAiQ∃rAgQ=kYI\≥h~∃E∀XAC]⊂AaeKMk[CE1rACe∃\OhX↓aeS[¬eSYr↓eKgK¬eGPA=eSK]QKH\~(~∃∩A]SYXA JAOY¬HAi↑↓iCYV↓oSiP↓s←jX↓C]HA$AgkO≥KghAe←jAa!←]JAM←[JA5←e]S9N~∃C→iKd@D`ACh↓[rAQ=[JA]U[EKdpjnZ@lndA=dAg←5JACMQKe]←=\ACh↓[rA←→MSGJ4∃]k[ Kd\~(~∀_≡`r5≠CdZ`d@@`@hr∪∃5ε@@∪
←[S]≤A←kh↓'CikIICr~))↑t@AYYn↓ChA&D[α@~)∪LASPASfA
←]mK9SK]h0A∩Ao=kYHA
←[JA=khA'¬ikeI¬rAM←HA'QC
WYKi=\AC]⊂A&Zb8~∃∪h↓SfAB↓G←]m∃]SK]PAiS[∀AM←d↓%←HX↓C]HA$Ao←k1HAG←5JA←kPACe←U]H@cAZAC]⊂~∃gi¬rAS]Q↑AiQ∀AKmK9S]N\4∀~∀_≡`r5≠CdZ`d@@`Dbp∪∃5ε@@∪5KKiS9OfAi!SfAgU[[Kd@@@~))↑t@A
_@@@~)∩AWK∃`AM←IOKii%]NAi<Aakh↓iQJA1∪' A¬]HAβIiSMS
SCXA%]iKY1SOK]
JA[K∃iS]OL~∃S\↓[rAG¬YK]I¬d\@AAYKCg∀AeK[%]HA[∀A←dA⊃↑ASh8@A)Q∀AC]]=k]GK5K]if↓CeJA=\~∃[dAIKg,Ag←[∃oQKe∀\~∀~(_≡`r5≠CdZ`d@@`Dfb∪∃5ε@@~))↑t@A
_@@@~)!YKCMJAIK
←eCi∀AE←s∃e7npHYU[GtACfA∧AYKiQKdAC9HAgGISEJA%h\~∀4∀_≡`r5≠CdZ`d@@bTjn∪∃5ε@@~))↑t@AeCP↓ChA&D[α@~)∩AQCYJA[SMYCSH↓ICiKLA←LA0]α\AMaCGJ↓∪]IkMierA5KKiSan you supply?
∂10-Mar-82 1229 JMC
To: csd.golub at SU-SCORE
Donald Perlis, whose resume I am forwarding, wishes to apply for a
faculty position.
∂10-Mar-_2 1543 JMC
To: GHG at SU-AI
I have no idea but sifce he's 38, maybe he's too old To be a son.
As yoe may remember, There was a numerical afalyst named Sam Perlis,
I believe also at CMU, perhaps a relative of that one.
11-Mar-`d@@`@`lβ∃5α@@~))↑t@AGgH9O←YkλAChAM*['π=%
@~)∪\A[dA←aS9S←\X↓iQJAMikIK9hAeKA←ehA=\A'Q¬aSe↑↓aCei1rAeK→YKGiLAG←]MKemCQSgZ\4∃∪@;&+↔⊃βf{⊂≡N4∞π⊗}},⊗nn≥lrε&|↑2εv}Dε&OD ⊗w&t
FF*
8
≥Y[p→→⊂1zy≤4qzv≥vP0yH4sεE≠7{P"↑4yz9K⊂⊂$7]r{2`2, I @QQS]Vαβ'QβO→βπ9∧K7C?↔#π;Q∧s↔]β&KK↔∂&K?9β4{Iβ∂|¬Wπ/L↑ hW<9⊗.v<Ubα∧∀λλ-T≠[⎇∧∞≠{h ]]~≥.=8<⎇
≤h_8M}=λ∀m <~<Mt|h~,L8(≠ld_{{L<;]≤L≡~;YaQ[{H M<⎇≤M≤]=→,D_{s.∞=~;Luλ~≠n|=Y<Edλ⊂].D≥~→-d~→(
\9→(∞={9=
;Yh ,=≥→.$≠⎇=↓Q[yH L8]9l⎇;Yh∞M_;H ∀≥~≠n\z≥λ∞
||z,-→+C!!"@↓Al,+)\<K ≤ ⊂⊂_\L→De&PP⊂εE∃7]⊂⊂λ32tsYw10z[P0z∀jfbl `df@λ⊂⊂εE⊃rw2P~0yP2[4vtw_z2r∀t0x4\7V⊂0[2⊂$P≥44w5H:44iH4yP0H14sP≠tyz0ZrW⊂⊂∃42P6_quFE≠s⊂9j≥p2w:λ2w:4≥ytpy[P9rb[yP:7H92s6→qz⊂0H1ww9Yy;0z~{2P0]:4z:Y2W⊂⊂∀t0p )pk's
interests do seem special given what iS currently beine taueht at Stanford,
but this is how Any new field looks at the beginning from the outsIde. I
think ShapiRo has a remarkable number kf very wide ranging and rather cLear
ideas. I expressed some doubts to him about his Interest in distributed
logic programs and got a Very cogent reply which I can send you iF yoe
like. I won't be at the March 31meeting, so I wonder if you are inclined
to urge a reconsideration. I would bet that Stanford is going to look very
silly a feW years from noW if we have miSsed a chance to get ShapIro.
∂10-Mar-82 2114 Gene Golub <CSD.GOLUB atSU-SCORE> [Tom Dietterich <CSD.DIETTERICH at SU-SCORE>: Ehud Y. Shapiro student interview]
Date: 1⊂ Mar 1982 2111-PST
From: Gene Golub <CSD.GOLUB at SU-SCORE>
Subject: [Tom Dietterich <CSD.DIETTERICH at SU-SCORE>: Ehud Y. Shapiro student interview]
To: jmc at SU-AI
Mail-From: CSD.DIEPTERICH created at 6-Mar-82 18:21:42
Date: 6 Mar 1982 1_21-PST
From: Tom Dietterich <CSD.DIETTERICH at SU-SCORE>
Subject: Ehud Y. Shapiro student interviEw
To: Shapiro-interviewers: ;, csd.golub atSU-SCORE, csd.ullman at SU-SCORE,
csl.lantz at SU-SCORE, csl.jlh at SU-SCORE( tob at SU-AI, rwf at SU-AI
cc: CSD.DIETTERICH at SU-SCORE( csd.jf at SU-SCORE
Group student interview with Ehud Shapiro:
People present:
Rich Pattis (REP)
Michael Kenniston (csd.msk)
Yonatan Malachi (YM)
Ken Clarkson (KLC)
Dave Smith (csd.smith)
Tom Spencer (THS)
Tom Dietterich (csd.dietterich)
Shapiro conducted himself well in answering some pretty tough
questions including many detailed questions about his work. The
students present were generally luke warm about him, however. There
was a sense that he was a quick-minded person who would do well in
whatever problems he attacked. However, his area of interest seemed
to be quite narrowly defined to be PROLOG and logic programming. In
response to the question about what he would do if he came to
Stanford, he answered that he would leave debugging for a while and
instead concentrate on parallel execution of PROLOG programs and on
applications of PROLOG to distributed computing. He also expressed a
desire to collaborate with the Japanese Fifth Generation project
(which emphasizes logic programming). This and subsequent answers
gave us the impression that he was more interested in PROLOG than in
any "computer science" problems. In fact, we were not sure exactly
where he would fit within the department. He stated that he is not an
AI person and disagrees with the current AI methodology. On the other
hand, he is not really an MTC person. Nor could we really consider
him a programming languages person. His primary asset for this
department would be that he would be able to teach PROLOG.
One area of particular concern was hiq answer to the question about
teaching. He ifdicated that he has never @QCkOQPACMH↓iQChαβ#∃β> Eβ;⎇ 4+[-∪eβ↔w##GOL∧↔∨&≤4ε∞⊗}ZBπε\≤6FNβY`⊗λ0r0∀houghhe would "probably @Q` eβ∞s⊂$+&yβ@>]H ∧⊂7w_w<P*→pqt4[3P0y\βignment @!JAoCLAOSm∃\\@A!JAgC%HAQJ↓o←kY⊂~∃@;|εBπx;]∧∞≠h⊂~→pqt a "cOp¬JAβ$@ β∂d∧↔>hπεEβE)z`-mari: no one @→KYhAACeiS
kYCe1rAgiI←]OYdAaQCPA`∨∃∧ε6F←]H ∧¬≠x@∞t7rf→∧¬∃]=hRAQ%eJAQ%ZP→↓∧{WIβn '9β∂+↔OSL¬vrπ|≡2π> ≡BεFTλ
m};→⊂_90w3H:7P)]0p∞f@=` ⊃_hR←*∞|W⊗*∞9vn=z_.D_{p↔_py72Y⊂:40]⊂42P≥wzv"λ53p∀↓achAαkW∂!∧∧Vv/,␈∩εNnMphWLX⊗≡F≥lr`HαC"EU5≠{!QK+ ⊗KVVVFB⊗VVFKVVFEβE$w my o@AS]@'|q1βSF)βOS,∧F.wDλ L↑≠|]∧
{H∀m <~0→≠P80y≥4∧p∩Aβ∪↔6LX7'~ 8 mny<]L≡~<{%A R0↔→2rr≠4πgi@ Aae←≥aC@7nK;≥β&{↔Mβv{Qβ≠LεBεNnMrπ& T¬∨&≥lf␈⊗Dλ7/↔-≤7.g]Pε∂~
→`hVmx
d >~<nNkHλ
β{r{→y⊗⊂$H:44w~P4z⊂~yP0wλ4vx7\80w:λ72{P→4y2q]4ww⊂→7y⊂![vx:z→yεE)Xtrw1YW⊂⊂$H0vP7≠z⊂:7[P2w:~ompu@QS]NX↓QWoKYKd\@↓↓`↔Q∧εFF.d ε*ε\≤F*π=x ,↑~~3L@P12`4ter @=kh~∃α{⊂∩εLXλN\βstg→β than @∩Aβ## ?\⎇π"π
x ntq6 %,∧⊂∀!Q `@l,#)\<K ≤ ⊂⊂⊂⊃ddh∪∃5
↓hRS-iα↓β∂O ¬f ={→0⊃λ0z⊂)UT¬SCOR@
@~)∩AQCYJAC@≤¬6.αλX ∧λβ2t`'enbaum to he`→@↓[@∃β,ε& <αP92Xww9`)deration @=\A'Q¬aSe↑↓oSiP4⊂ @& Tε -βv6 /wi`≥NβP4(Q(v.vTλ
≡h→0⊗~vp nated Shapi@I↑PAC9HA%∧εFFNβZ`⊂≥44p∪ is a↓ESNAαk'OS∞[∃ 2∧
FF*
Hλ,=c"P↔Yα stude`≥hαβ↔;SG+@≡N≤∧p⊗H9rr`-pεAi↑↓` ↔≠d∧V∨" ⊂∞≡}n8 .8εadive attit`+α#∃ 2∧
6F∂
_ Mt|c"M≥]→0→→yz0∪ dh∞Agα+↔5β≤εε.≡≤≥Bε>≤h -d≥z_.D~8 P_zy0∩enp YR↓EK@'v9β@&≤¬0∪Z8∧ at Stand¬P∨K ¬@hV,¬0~λ8∧hi@LASfAαC?]β∞seβ;,εrε6α90⊗→⊂67`/hπfACPAaQJ↓EKOSαs;'lpλ @90∂m↓iQJAα{WSOL∧F*@Hλ∩!Q]~~-mh⊂ `(api`%<AQC@~β¬βK,¬V∂⊗αx8ML(≠]-\Y<@⊂≠pε v@∃` eβ>K∪∃β⊗ ;∨'v9βπl@λ∞0z42\α cl@∃Cd4T¬⊗&.≤5bα∧α(⊂∩↑892`3pπ@↔⊃∧ε6}nTλ
}8]≤d∞≠h⊂∀~vP0q≠zz⊂ (is i@9iKeKβ≠Qβ'p∧ε&O>N&N↔↑LV Hα[⊂↔Yβic Ppkg`%¬[fAC9HAO←β!β¬β4∧W/(_p↔Yβ` @; ∧π,<≠⊂≤H;t4`#h @∩Aα≠π9β≤∧Vv"∂_ nT~9H∂≥⎇#"MM8y+D∧⊂(⊂≠[w∪z be at the MarcH 31 @5KCiS9JP⊃β≤¬r∧J∞⎇vv&↑ λ
≤β⊂<g]P0y2H4s1`,ined
λto Urge A rec@=]gSI∃aCiSα{99↓∧Iβ←?,c⊃β -!βS#∂!αOS∞s∪?K β'Mβ>{';≥¬#=β3|{ ~πlZ'Hh.9⊗fgα(⊂⊂H32{P≡rpy9H397vH77sP~s⊂;rH40{ % missed achance to gat ShapiRo.
12-Mar-_2 0117 JMC my trips
To: FFL
For a Livermore personne@0AgKGUeSir↓ckKgQS←]]¬SeJX↓∩A]K∃HAi↑↓YSgh↓[r~∃α3?K↔N;9βS⊗KCM9ααπ37␈≠Qβπfaβ/→π##↔5εCπ[∃ε∪↔↔9πβπ'⊃π##K?.;!αO& ;≠?⊗!04+∞s⊃βOzβ↔cC.sO∃β⊗+C?K'→β↔cO≠Q9↓¬β3↔π≡)β≠'v!β?W"β←#π βK↔∂␈∪∪Mβ/C'OQr↓α$4Vs↔↔⊃ε#πS↔~βπ;⊃ε≠?W;'∪'↔Mπ3'O'&+⊃9↓∧Iβπ3≡yβπ5π+O';:βS#∃εs?Sπ&K?;MεK84+oIβCπ≥≠C?K'→1β -!β?;*βCπO∨β?KQπ;πMβNqβ¬β∨#?3↔pβ#π∂↑+Q9↓¬##∃β'∪'CMε#πS∀hS π∂ZβS-↓ IYU9ααS#∃εk?OQεK7C?↔#π;Q∧ K∃β'∪'CMπ#=αK/≠O'¬bβ ↔∂∂+O∃β&C∀4*↔+OO'∞sMβ∪}q∨Qβ/≠Wπ3gIβOS∞kAβSF)βCπ∨≠C?K"βπ;⊃π#K'C~β ↔S>+↔9α≡+CQ9β eY\hSπ;⊃∧SW3eβ e]Iε3?Iβ>C'∂!π##∃βε OOC␈∪Qβ'~β7'O≡K;≥9ααg?Uεk'∨#"βπO-¬βπSSHh*←?}!β←#∂!βK↔≡{K∪Mπ≠#∃β&C';/~β7'∨G!β ∃ε [π'f 3∃ph(4(0=E∩j7πIkAI↓↓β→MD&Tj
↓hRS=iα↓α~~b↓↓↓hRC3↔∂≠∃βC⊗K;Qβ
β∂?CJβ?→β.k;?YwβK⊗o;AI3+n~uβπv!β7π↑)↓Uβ≤{C'↔~p4(4P0=E∩j7πIkAI↓↓ ⊃U\&Tj
↓hRS=iα↓αJB:aα2≡~↓↓↓hRε∩ZL~⊗n]C↓2*6≥iβ∂?w#π';~βO?7*↓Eeaαβ'∪↔∂→84(hP0-E∩j7πIhπβ∩αε⊗3#Hα2S(∀λβ"JMnHλ∧ |y L⎇{≥8D =λ∀jU4psj((β"H≡h≡0↔]P5w7]V⊂42H3t{2\P0w→|1r`,lent lecture. I will call him afd↓KqaY=eJ~∃α3WKSF+AβSF)βS↔∞≠#'≠8∧π∂.↑:FN}e`α∧Nd
WJε}
⊗vN⎇aBεFT
vNfD
⊗rεl≤7"ε,Tε}vT
v h-}W∩ε,ZG&/$λ
\8z→.∞kλ⊂⊃→qpz`3e he is sO welL organized. IF his teaching
profepεAk]MCiSg→CGi←IrP⊃β&C↔9β>)β∪?r;Qβ#∂3∃βSzβK∃7∂βC?'w!0$(hP0 ;⊗5Tn∂%P∞ε$λ F6 ∧e&Pβ
To: rahat S1-A
It l@=←WfAαc'/∃∧I∨31∧Cπ[∃∧εFzε,Tε∂"
v␈6↑ ε∞fDλF∂J∞Mvn␈.-w:ε≥J6zαTλ
m≡~β"JL9≠⊂∩\↔⊂⊂(→y0λappεA%>c1βO,∧RεF≥Pλ∞M→<Y%@∧¬α
λ∞bf5≠CdZβAI↓↓ 1UT→)T4λλα*M_;Zn∀_;Y∧∞_<X-M→;λ
∞Y{∪l@P⊂εE∃7]⊂⊂λ*#a
11-Mar-`d@@bβ IP&,CW↓α≡CπC'⊗y↓bOF C'KzβπQαL
2∃YJS#πv[Eβπv!βCπ⊗ 3#↔bαCK?d{⊂~α↓Q$&∂LW"αα∧ε∪
@38<EW H &FLK1*:β"QN
βv]⊂λ⊂⊂"t≥p⊂)t_x4y7H≤)t0\4y7P_z⊂,`S"X∞
Subj@∃GhtAQQC@;←→βπ≠ ∧πε∂,≥Ff.D
π⊗}M|phUMw"αα∧∧α∧Vβ8h ≡λ∀u%X2#"L<nHλ∧∧λλ∀m <~4Mt_9 _3⊃#!!"U~ ≥Z|h mβy⊂,[zy⊂ (ospiTality. I fkund Stanford an e@aSiS]≤AaYC
JXAEUh∩+∞cO=β∂+'S∃∧K;S↔w≠∃)↓∧IβOSLc1β∪}q∨Qβ↑s?]βL1α%β>CπQαJβ≠↔3 β←πM¬##∃β&+;O'}p4+π⊗{W;⊃¬##∃βT¬v∩ε≥nF/↔m_ .uλ≠p→λ:42Pλ5q5 %ctive ∧A]CQkeJA=H βSF)βC3∞≠∃β''≠↔3→dπQhA1KmKX4∃P∨→ε OS⊗ ∂S'}qβS#,π∩ε&t f␈" M⊗&6↑!∩`$λ∪{LT~<h∞M_=⊂≤0y0v≠2r⊂(≤5v7cH1pwεBαbe ExecuTe` f@¬giKd↓←\ABαβ7WNM∩oπ-x6/∨=x D
88r
≥Y+λ∞>8z ≡h≥~ T≠{Y$∞~→#! X8⊂-l<y( ≡Y(≤
L8π74[3P:7H1:t`,d. The o@QQKdAαK@~πM ↔"∧∀λ
9Z`⊂≥40r a
∃mα K'πw!β >d
πε↑M|rεn∨∀ε⊗* ⊂λ∞l<↑(∞↑y9P~[⊂37`2 implementing Distribp iK⊂~∃CaAYSGCQS←]f8@Aβh↓iW←V↓[CrA∧AoQS1JAi↑↓eKCYαKk∃β&C'M⊃∧∪WQβ&C∃β7|ε&*∧⊃Q'&F≥m2ε∞-}W"ε≡Dπ&FT
V␈⊗T WF≡≡LV"∧∀λλL\{{9'$λ~;D ~<⎇∞
8]5 \ |⊂⊂\0p lEl αPRologa goal coRresponds To a ProceSs, and a @MQCeK⊂AmCe%CEYJ↓EKio∃K\~∃β#←=β>{π3MεKEβ¬∧≠?77.s'∂π&K?9β≡Cπ;;,aβ ↔';↔↔9πβK?∂/≠O↔Mph(4*6{Iβ↔F 7C3*aβ#↔⊗)β'MεC?]βN{Uβ←⊗KS∃β
β7W3&KC3↔F+I1βn+K∨∃ECM2g~bkM%bβS#π h+7↔⊗;↔Mβ&C∃βS>yβ';π+QβO'∪↔π7~αcMβ∞s⊃αg~β';Szβ?;∃ε{WSC/!βOS⊗+π5αW→h4(hS7↔K>)"nueZu2njI84+n+K∨∃EZcrc≥i2gMeZcrk≥i%↓ijβ7↔K>)"cMeKM2k~I84+n+K∨∃ECM2nObgNueZgrk≥i%↓ijβ7↔K>)"cMeKM2k~I84(hR∂3↔∂∪3e1¬βK?3}9∨Mβ/C↔∂W&K?9βn+∂#πvKO5β>{9∨Qε#=β#/∪∃iβ&C'Mβπ∪?∨K∞iβ'LhSSKWgIβ;?v#↔S↔⊗k';'∨#'
1ε ;⊃β&C∃βKN;#Qβ≡cπWO*βO#?.c⊃β *β';[}[↔⊃β∂→βO?}p4+π~βS#∃εK;CW"βπKKO3↔Mβ}qβS#*β∂#πvs↔1βO!βK↔∞#Mβ≠⊗{59↓∧ 3O=bβ7?K*βOSKNs∨↔; h+πO≡K∨;7.sQβ?2↓ 7?&+M β&yβπK?+7↔;'→βO#␈+3⊃β⊗)β∪?v)1βSzβπ[?N 4+7.cS'Cf)7←KO#↔KMε≠?;≠fK∂SMph(4*≡cπK-ε ;⊃α?∪↔∨?↔I1β'rβS#↔O⊃βCπε+Iβ'rβS#∃∧
∞5β≡{;→9αβ?9β7+;∂SN{;π0hS3π;?+π∨∃ε ;⊃βn ∂#'v)βπK≡C'S↔∨#WK∃αC≠K?jβO↔[/∪π1βn{;S#~βπ∨=Jaβ∨'6)βπ8hS↔cπoβ3∃β}1β¬β≡K7C3*β?C↔⊗ S';:βOgO&+51β>KS!β';=βO∨∪↔↔;~aβS←zβ/↔g⊗{πK∪_h+π;"β?;∃εk?;'&{I1β⊗ O↔⊃ε{9βSFKMβO'K3∃β}1β#πv#3';:βOSK. 7M8hP4*'"βO↔↔o→βS#∂!βS#∂!βS#*βOSgf)β?→πβK?∨⊗ 77'v9βS#∂!βK↔∨+3SMε3K?5π##'LhSπCC⊗{π∂!εKE↓"JβS#'vY%β∂∞c3↔⊃ε{ +↔∨!β?KN+;S↔"q↓α∂}sO'∪/⊃1β≠␈⊃β↔c∞kC3∃`h+S#*β≠?3f{←';:βCK??∪π7Mε3?Iβ∨#π∂-ε ;⊃β∂+↔W∃εkπ;'π+3πSN{99↓¬##∃β∨#π∂,hSCK??∪π5β⊗+∂↔'6+Mβ7/≠Oπ∨/→β?→π≠Sπ∂Zβ?C↔⊗ S'?w→1βC/∪≠?Ko→βS#*β?C↔⊗ S'?ph+π≠ βK↔S-∪9βSF)βK↔∨+3Q_hP4)∃π≠Sπ∂ZB12c~I↓i5ε+[π3. S∃β&C∃βO'∪↔π5ε{⊃β7/≠Oπ∨/→α1β}qβOS∞≠-αc~p4(4W≠Sπ∂ZBnu2zI84+∨#π∂-E[C?AEA'r∩jbfcrG~u%↓RiβOS∞≠-"1eCM%8hSOSπ≡Y"oC/≠!"aOb2u2G→%↓ijβOSπ≡Y"12]CrcNjI84(hRS#∃εK;'SN 3'k∂#'?9εKEi↓π≠Sπ∂ZB12njI1β←F+K∃αbβ'Mβ&C∃βO'∪↔π5ε{⊃β7/≠Oπ∨/→84*∞cS#?.;!βO& ∂-βO→β¬↓⊗;3? ∞a β∪∂#¬βO'∪W∂S/∪∃1β&C∃βC⊗{∨Kπjβ'Mβ7+;∂SN{;π1`h+←'&Aβ;=ε+cC3N≠'Qβ≡K∪∃7.3≠↔∂'→9αSF)βO'&)7↔≠6+∂Qβ∂∪∃β∪}s∃βSzβS#∀hS[πKN 3∃ε{←↔;.!β eπ##∃βπ∪?∂↔∨→↓ O& ∂- ph*S#*βπ;O>+KMβ&yβS#*β7πO≡ ∨↔Mε K∃β⊗+SWKv+⊃β'rβS#∃π3πK'∞∪3∃αBβ≠?Iπβ?A"BI84+π+O!"BIβ'MεSWOQε+c↔∂/#↔⊃1π;'S!εs=βK/≠C?;≡)1↓α&C'Mβ≡ 9β↔∂≠'3e∧∧&*ε]|FN6≤\@hV≤dπ&F↑,RεO4 ∩εv\\Bε6}$ε≡}lm↔⊗n≡M⊗}rd∧∧6␈$ WF∞↑
F*b
yf*ε<≥bε∞LDπ&FQQ&≡f≡Z6(h!Q'∨&≤=2E←∞↑6BE¬Mv@5?∪↔%K≤j(π%(≤⎇ ≤zj∪¬Kv∨⊗∞;*+C!!"Uz
≤zλ∃m≥≠λ≤L↑|≠sLD {zdt~;@ ∧≥≠h∞M→(≠,↑|x9lT≤≥<m¬_+⊗¬∃α⊂;t→w⊂:4→P6ry\psrFB92qrZ{2r⊂_w2⊂9]qqr`3sfulLy procassed.¬
IT may saemdh∂eE%ISMNαβS-βLs[?/*β¬β;-9βCK|≠↔OM∧3?Iβ,εf/↔∀
7&∞=0ε␈ε↑,↔&N⎇aPRF≥lBbπM V␈⊗↑M⊗≡∞MO∩π& ≡B?~∞⎇ε∂"∞Mε*π>L⊗≡Z∞
&}?,≥Rε&|↑2JB .W"ε Z&*ε⊃Q&v/tλλm⎇Xy<∞D_{s,↑h≥≠d
⎇<@
8ε8≥λ⊂:0t[⊗y2a]y9t`/n optimaz@¬iS←\αβ?λ4Tε6/∂\Yg&N≥D¬π⊗⎇Iv 4≠8<∞∀~;]
tλ\∀M|y<|e]|≥~-]>X=
≥{H@
≥H→~.>≤Z8N↑→9β!*≤[s
|nHλ
≥\⎇→,≤α⊂7cλ4w;7Zβifga neW process With the new stack, ProceSs
optimi@iCiS←8AoSY0AeKi¬S\Ai!JA←Y⊂Aae←
KgfX↓EkhAβ;'31εk?∪'7Iβ'S~β[πKN 3↔~`4+¬v)1β''→↓ O& S∃ bβπ;⊃π##GM∧K;∪W≤)βπ→∧K7C3L≠QβOL#∃7↔43↔∂Qph(4
∞cS#?.;!βSF)βπC¬∪?π∂@β;↔↔'→βOGv≠#K?vKkπSL¬vrπ∞-⊗nOM≡f/~
mw"ε≡hλ-≥_8[ Q"Z;D ⎇<\L]]λ∀∞
{≠qeV, λ∞=9<∪ TλY~.>≤Z8N↑→9⊃λ897s\0p
s, sucH as @QQJA←αs∀4 4¬w$≤⎇_,=h_;LD≤=9.\αP∀1→v7{DH6p|P≤z4v , be Execu@QK@AI%aKGi1rAS\αβ'Q→αα≠?HhS↔cπoβ3∃HhP4+qβy5βO& ∂-λε|∞↑z
_%∃≤≥<m¬_J+∞
|
⊗¬∃α8:yZ∀1TV≤7x∀,JT∧poP(Z),Push(d),pop(W)] Xπ:R\4⊂⊂∀
:↓uβ⊃`h"a↓hβ 04UI↓eβ~`4*@$πRελQ!P@/9<c!!αA(zYzryP_ps⊂!→P4vx≠2rr`.ted @]SiPAβ##∃β≤ 7¬β,∧↔<+Hλλ,;≠p≠H0s⊂ %xa`≠a1JA←L↓BAckα+W¬0hSG'↔,cπS↔ ∧π>OMλ ∀λ[_//(≠⊂∀\z⊃↔εB⊂εE∩H8zr`5e(@_YEQKCHαbGSπL¬BJβ%Pλ ↑X;∃,≡→(⊂~~2P6 )pπhA←α1β'↔≥≠π>↑4∧bε⎇`λ∞≡9=1!QI(⊂≠Z5yrP~2pr is Qhead @¬]HAi¬SXASLA#iC%X\4Ph#GW,εV*E9QEzEu∃`hW≤¬0∩]p¬([add ⊃0αKr2ue #↔π ¬E@;≤ε(z_tp ] :- @Ek@↔W*B12GF+π"β∀= ≥8ε∀WβE8p∃@∃k@∃"←∪↔7}h % λ8∞&↔T∧[X|Qhead]( #I¬SX@%βQ5βG,∧W.*∪
≥→89¬J=_:-E+C"AQU~→$
8π4`4ia`_Aα≠π31∧¬↔4≤90∩]p¬(L,Qhead,Q`⊃Kα ⊃%9αα≠/I∧∧WF∞β<∪ W@εEεB>⊂∨VH8zr`5e([add(a),a` HQλRP∪K,¬V␈6U αJ@≤Y0⊗[{2T,JT∧add(c ∩Yβ∪↔7|h % J7+
∃α(TWβE
X 8
ABα`4*@∀πRε∩AQ%@$∂(⊂⊃K∧¬∃"α↓uαoλ¬F∩f?Ks≠l7#!∧¬∀~))QJA5←AJAβ≠#/Wd∧Bε⊗Tλ .\αzrT
T∧-,+)( s@<AaeSαK;≥β&yβK↔n{[∃β∞qβ↔LX ,]]β"L@90∂m↓C\AKαkCC@∀λ .\αzrP≥tp l vi`∨Y¬iJAi!JA[←α#∃βπv!β#↔v≠∃β≠∞K11β|ε"π⊗≥_ lT_;C!,>_p∩\:4wg ∧AεE∩4πweVer, @]SiQ←UhA[←α#↔MDλ L]8π{ %(X ∩Aα{9βπp∧ε.o∞O∩π∂\X
,Q ]z-Mα⊂:w~s<P,λ;tz4λ:42P_x897\94pz→P2v %m` @; β?2∞Mε*π≤X .\αP;t→w
@∃]WkO ACIHαβ?C↔⊗ S'∨w→β←'d¬Bε⊗TλF}vU`λ∧λYx example2
| ?- qe@∃kBQ7¬IH@#λ¬∩g⊗]]w6* ↓∩g⊗]]w6* ∃∩f∞LAε~JN,Vn␈lU¬BMβ+∀%J*+C!↓ VλπT_+β! ( ⊂_VεE-λ≤P'XLX∩εE∀P≡P-XT∧c,←110|←345@:4∀∩¬)!SfASβ→β¬β≤εWεN|Z2ε⊗] ↔6N} D∧⊂9
\αpw9H:40zλ:42`2e is no need to
syNchronize add's and @IK[Omα)∨M⊃∧∧⊗v" ≥gJπ<X .\8π1bH4πf Them Will unify
phe n'th↓KYK[∃]hAe∃[←mK⊂AoSi AiQJ↓\OiPαβ↔3↔n+;Qβ∞#∪↔⊃bβ↔[↔pβ'2∞Mε(h.,Vn␈lTε}≡>X L\λ_Y,@4πre the Corresponding add.¬
λI`≤AMk[KCIrP⊃αJβS#'vYβS#∂!βπ∪bβ←'MDε⊗.lX M≡λ→P→≠vP24\z94q≥z2r/parallel
PrglOdεt@A%hAoS1XAK]¬EYJA∧AeSG!KdAaβ∪?∨K∞k7'lpλ∞≡≡;⊂∩K⊂30y]2y⊂ %xecuTion
o` AaI←GeC5bXAC9HAC\αβ';∂⊗+πO↔ ∧π,8π3rH5s⊂ \864`#atioNpεAiQ¬hAGC8AEJAM←YmK⊂~∃oSβ#!β¬∧¬εN> X D
α2{"[⊂60w→zpsrKαλ
∧~(@@@@@@@Z4A+IR8~∀ZZ4ZZZZ4⊂∩(0-E~j7πIhπβ∩αε&β#⊂→)T~α∧↓⊗∞g]]⊗w.T∞ε␈>↑$π&Z∞Mε*π YwεfWtααα↓Q%&{$∧αεfNtε∂"
6∩l
↓Q$≡∞d∞FFO4 &+{qQ$&∂LW"¬&∞↑'≡&∨∃Bβ"λlV↔↔\≡'Jβ↔↔β∩αε⊗cS#eZ¬≥ Q(g⊗}W$∧\Lhtε∂" 8U≥%(Y@hU>\&V.>G"ε∞L]VNw]Pπε␈|↑"π&t∞FF*∞ V␈εLWphUMw"ε.lZ&?J ≡Bεn≡EVn_Q,6≠R =⊗v: ≡B∧\Z:E∀,AQ hP→∀εF∂lTε
ε ≥F2n,≥6."
_F.
aQ hP→L↔?⊗]l6*∧M≡f/⊗]z&*α L⊗↔~∧ 6f∞≥↑2π&t∧ε⊗*∧
vrπM Rαπl↑&>*∧
v"α ≥`hV≥NVnNn]Rn∞≡$ε⊗∂NLW↔J∧∞FF∂D∞v␈.LDαεF≡hRε
∧∞&∞v|Tε}2∧ε∪+β∧
VNf↑4αεNd∧ε∞pQ(Vf.>N&N~ <↔∩b
⎇bβ;∀
F∩r
xbε∞N]VNw]Qbα∧≡Dε∨/.,Vw"∞∞&N≡↑5Bπ&
≡2ε∞L]VNw]QPW>}]F"ε=}7"α ≤&␈/D∧α#+UDε∞vD∧εO"∧∞v␈.LDαππ-}fN&T ⊗⊗␈↑Dαβ+ε∧α∧]y∧απ/=≥f8h.,V∂≡⎇l⊗⊗fT W∂&≥\↔&/4 f␈∩∞Mε*ε]lW⊗?∀λV66≤=⊗.v?∀ε}2∞Mε*ε<≡"`h!Q Lo∀
⊗&.∀∧εO~∞Mrαε=yg≡NL↑"αε≥dε∞g]]⊗w.T∧ε⊗∂NLW↔J mwαα∞Mε*α∞ w>∂!Q'≡␈↑,6*εmz"ε
w/≡Udαα¬ \⊗ZεL]V∞vD f␈∩ ⊂αεF}↑6*ε≡4ε≡/.L⊗NvO∀εf/>4απ& ]`hPQ 14-Mar-_2 2304 JMC
To: LES
What's your bu@MS]KgLACIIIKgfX↓g↑A∩↓GC\AUgJAs=jACf↓GYKCIC]GJ↓eKMKIK]GJ|~∀
∀_⊗bl5≠CdZβAI↓↓β↓E@&Tj
↓↓π3'¬α≠ 6¬hRS=iα↓α
~b↓↓↓hRC &\≡6*π,]VNvD
V*πMtπ≡∞l@∧fOlX M]|Y( ∀_Z;
D→[p→λ:7r0↑W
λ∞bl5≠CdZβAI↓↓β⊃MH→)T4λβ"JMnHλ∧∞X: ≡λ∀l%X(β"JL9λ⊂-l→<\m⎇H≥SmNαs:2Yy9P*≠P42`,p wiTh Shackle@Q←\\~(~∀_⊂≥E2j7πIhπβ∩α∧⊗c#8→)T
α↓Q%&{$∧απε, ε∂"
6∩l
↓Q%ε∂]L∩b∧∀λ
⎇I⎇⊂≥pw:⊂≥4π ofdiciallp∩AMkE[Sβ!βS#*β∪'≠>+KCKNsSMβL+Q1β⊗+∂πW≤∧R∧HQ-ε∂6]dw"ε=x .
→=→,D≥~→$
⎇~→.$≤_< ↑{|Zedλ∩≠n|=Y4ED_<p∃H:42fH4s⊂:~2|P0\2FE+Zv64w→P:7P≠5wuP_z⊂:4→P34w→ry8)~w:9P_w2⊂9X|P;t→z42yλ:42|H0y2P≥2qt7~qpv6≡FE9p]4ys Xz7y<H7y⊂+Z2z42\⊂$P4_{2P:≠P40{→P:42[P27w→P0spZw↔⊂⊂∃42|P~0{2P≥5P12CE1v2Xy⊂2g≠zst⊂→αor classid¬SGCQS←\\A∪LAQQKrA¬eJAi∃GQ]S
CYYr↓gCiSMICGi=erX~)iQK\αβC3↔∂≠∃β/,+AβSF+5β≠⎇⊃β7∃π+;S'bα%β#∂3∃βSF)βCπ∧+K←?⊗Yβ∪?v)9↓α&C'Mβn d4+& /∃βλ∧π>F≥HRεf⎇lv/∩Dλ&.≡≡X lT∩(∩ ≡Y(∪L↑Y<H ≡≤≠∩,\λ→[n∧_(⊂⊃[2py0[1rP1→s3y2K∧@
and A @!CmJA5CAJA5C]rA→←eKS≥\Aie%afXAα ;⊃βM!β'Op;Qβ↔∂≠eβSzβ ∃β∨+K∃β&C∃β3O≠P4-≡2ε≡⎇↑εf/LU`hPβ"@↓AβX[⊗Spy⊗@82 !↔24 JM@ε@@~))↑t@AYYN↓ChA&D[α@~)∩AiQ∀AIeC→hAeKA←ehA$AgK]PAs@?αTε}rλ8
≥Y[p→→⊂)P@ contract @=P
|4Ph ⊂`@l-k)\<K ≤ ⊂⊂__L[De&Pβ
To: TGB@@@~)(∂#π ∧εN∩
Rε∂=>2εnT
vF∂D u%2∞>F∞vN4ε&←'qPPH `{⊗uTn∂%Wβ∩αεε∪#→)T~α↓Q%&{$∧α∧dx5B¬∃λtααα↓Q$f/D}2εn≥<RεOD V}vL∨∩ε∂Dε'εj∞Mrπ&≥M2ε∞-}W"πM R∧∞Nm⊗≡*
L⊗↑/%aPPh `[⊗uTn∂%P∞ε$λ F6b2S(∀λβ"JMnHλ∧ |y L=≥<Y∧ =λ∀jU4psj((β"I∀~≠| T≥≠h -|\[nt⊂{s.∞=→4Dλ<⎇_,-~<z
\9]λ ≤]→4D (≤Y.N<[KAQC"@↓Al-k)\<K.ε$λ F7I don't think The added claus@∀AS\AQQJA≥e(AS]Y←SGJ↓←dAYα+S@&↑!PW≡≡4ε∞N\X ∧∞|→0m≤X8x-M≤∧P ]⊂:yWλ⊂ P 4hifk↓ShAo¬bAakβ!β'9∧∪↔∂π,ε6*ε|dπ&FT ⊗v∨,\↔≡.AQ&≡}↑∞W&/$λ l↑]Z0⊃YyP8 2ovided general@1rAC]⊂AEKG¬kgJAQQJA≥e(ASf↓]←nA=IMKe%]N~∃→kYXA9KofAMiWer↓g@↔K4¬⊗≡∂4 ↔'≡]H E@⊂⊂$cλ:42lH40r_2rw_ww1`%ph
KH↓CE←kPA←kd↓kgJ~)iQKr↓o←kY⊂AQCmα)β←KM#S↔9ε β#↔'#↔Iβ∞#∪K↔≥≠↔⊃β&yβGMπ≠C↔∂L3'∂πdceβ'w W'KNs≤4+∞∪?WQ∧¬↔"r∧
FF/,X M}Y+λ ∀≤Y0,lX<[$
>(⊂↔\4p∞i@=\AiQ¬hAs←TAgQ←UYHAUUghAg%K\Ai!KSd~)C@∨K,∧Vn∞β] ≥Yλ∀l]Yλ∩.D_X8mU
λ λ∞bn5≠CdZβAI↓↓ QP&Tj¬↓hRS=iα↓αR≡⊂∧ααα↓Q$Jπ
vv.D V}≡5`λ∧ →(≤l≥9λ⊂~~0z⊂ 4he pRoposal would have to be ResubmitteD,
αc@<A∩AKβCC#πLs↔↓β∞∪?WQ∧εFF*∞>V≡≡↑>2ε@yH⊂~~2P6 /ng cAmpaign to ma`↔J↓s←jA¬\~¬β⊃Qk@;≤εB¬π-xf/∨=x ED≤{h∞|(_9n,99λ∞M_=⊂~z⊂;t→w⊂4`4 is Resubmitted, you should
Be PI. Fo actiOn is necessary until yge gat @M←[Ki!S]NA%\AiQ∀A[CS0XAEkβ 4*%¬##'≠X∧εO"
]⊗.GD &*π⎇}'&B∂≥w/∩∞⎇εNfT∞FzπL≥FZπMtεFNT
vrπM Rπε
⎇f*pQ!PP`[⊗uTn∂%Sβ∩αε⊗Sβ@→)T~α↓Q%&{$∧α∧dx4ααα↓Q'↔εt f␈: ≤w⊗.↑4π&XQ&β~k&!∀n}lL↔JβL Rbπ. rε∞lDεf>5Dε∞≥Z0lT≥_:l↑C"C!↓AβX[VSpy⊗@82 2⊃59∪∃5α@@~))↑t@A¬
_@@@~)KYYKβ⊃0∪λβ"C!↓AβX\⊗Spy⊗@82 222∪∃5
↓hRS=iα↓α4iDααα↓Q$JεlX ,D≥≠h∞M~;Zd (_Z.D≠;p→→P12`&ore I speAhεAi↑↓≠ef\αα/W≥ph $λ0 ;↔¬Tn∂%P∞ε$λ ,εWα2S(∀λβ"JMnHλ∧λ{{≠,↑X91.⊂0z MIT-MUHTICS
test
∂18-Mar-82 1244 JMC
To: Colmerauer at MIT-MULTICS
Your test message also received ok. I have begun to think about alternatives,
and I'll send you another message soon.
∂18-Mar-82 1600 JMC Colmerauer is on ARPAnet.
To: AP at SU-AI, warren at SRI-AI
His net address is Colmerauer@multics where the capitalization of just
the iniTial Letter is essential.
18-Mar-82 1718 JMC
To: warren at SRI-AI
It would Be interesting to be associated with the VAX Prolog project.
λ∞bp5≠CdZβAI↓↓ 9I@&Tj~α↓Q%&{$∧απ≡≤.&.r ≡B¬≥)∃T\b↓Q$JεM_Fr?Dλ L\9λ⊂l≡Y9P~[48 @∃]WkO XAY←α;'
β∧ε&}∨,≥VnNβY`⊂_y1t4]2qz:\2P4`3 eve@8~∃@7|ε&*ε≥nF/⊗↑8
≥YkC!↓"@I didn't Read CarefUllp∩A∃]←kO XAY←≥SFAaI←OeC5[SMNαβπK∂FKS↔∂'+K∃βM→β↔[,p4+↔⎇∪∃β'w#↔K↔≥#';≥ph(4(0 ;↔∃Tn∂%P∞ε$λ ,F7α2S(∀λβ"JMnHλ∧λs∃λ∧∧λβ"J|αP40]2P0wλ0x8'Zw:6r[:⊂;t]4⊂'u[2y⊂ ]⊂_XM X⊂7gλ&ww2_|WεEβEβ∧π19-Mar-_2 1256↓JMC
To: warren at SRI-AI
Dh∞As=jAQCYJAQ←5JAaQ=]KfA→←dA↔∃SiPA
YCeV↓←dA¬=DA↔←]CYgW$}~∀~(_≡br5≠CdZ`d@@bPbb∪∃5ε@@∪⊃KYCr↓←LAiIS`@~))↑t@AeCP↓ChA&D[αXA1YnACPA&b[∧@@@~)≠rA Ue←aK¬\Aie%`ASf↓IKYCeKHA←9JAC]⊂Aa←gMSEYr↓io↑A]KKWf8@A)Q∃eKM←IJXA∩4∃aYC8Ai↑A≥↑Ai↑↓iQJAMaCGJ↓∪]IkMieSC1SuCi%←\A[∃KiS]≤AC]H↓CYg↑↓mSgSPAiQJ4∃&Zb↓ae←U∃GhACPAYKCMhA←]
JA[←IJ\~∀4∀_≡dd5≠CdZ`d@@`Ldj∪∃5ε@@~))↑t@A
_@@@~)!YKCMJAMS9HA[J↓YKii∃efAMI←ZA↔∃SiPA
YCeV↓←dA%=EKeh↓↔←oC1gWR\↓∩A]K∃HAaQ=]JA]U[EKeL\~∀~(_≡dd5≠CdZ`d@@`Pbrβ∃5ε@@~))↑t@AUEd↓ChA&D[α@~))er@ QKY`↓YWOS8DA←\↓iQJALbAM←=]Yr\4∀~∀_⊂≥I∩j7πIiAI↓↓ 9UDεTj¬↓N{;∃β> eβ7O≠G'⎇`π⊗/
x NDλβ"JMnHλ∧
≠≥h ≡λ∀l%X+λ∀L≥λ_=∧
l+0%D≠:;N=|∧P ]⊂&dj `dVεB⊂⊂⊂⊂λ⊂20w≠<P0zλ&dj⊗PdPεE∃42P&_yz⊂8_x2y≥pP;p[82r~0yP#~w0v&≡P0p 0eared. IT is Entitled
"The @=]J[o¬rA[C9]KHAMaCGJ↓[SggαK?9 ∧∧'J∧-yεr∧U`∧∞␈,Dε∞vD F.}l≡&"∧U`λ
<8;⊃!QX;Y∧∞x8 P~yyz`%d in196"8@Aβh↓SfAM=` β¬∧¬vv*
\⊗rε]≡7=8πw↔λ⊂)w`-e of the
life-suppopp c@=[aki¬iS←]LASCr↓giSY0AEJAβ∪↔3↔4 ;@"d∧∧J>MDε↔⊗≥lrεODλ
-a Y≠d ⊂ε'& αλ
∀~(_⊂≥I∩j7πIhπβ∩α∧"∪β0α2S(P⊂εE∃7]⊂⊂λ εFL
Thad↓oCfAAeKggα+eβ'2βg?U∧Cπ[↔p;QβO,¬g"ε≤DπN= C!↓ @↓AβY→VSpy⊗@82 !Db`∪∃5
↓hRS=iα↓αJB8∧ααα↓Q%'≡tλ
.P34`.e( 4Ph ⊂`@lLk)\<K ≤ ⊂⊂→λLX@ JM@ε@@~))↑t@A~~b↓↓↓hS∨?3.⊃1DQ!P@erauEp at↓≠∪([5+→)∪
&@@~)∩A]←\Aae←A←gJAQ↑ACeISmJA=\A'CQkeICdXAβaISX@b@AC]H↓YKCm∀A←\AMCike⊃Cr~∃5Cr@p8@A/S1XAiQ¬hAEJ↓←V}~(~∀_⊗dh5≠CdZ`d@@b\j`∪∃5ε@@~))↑t@A
_@@@~)∪hAo=kYHA JAO←=HASL↓∩AG←UYHAY∃CmJA→←dA→%mKe[=eJAi=[←ee=nAChbcCZ8~∀~∀_⊗dj5≠CdZβAI↓↓β↓UL&Tj
↓O W/>M⊗}vl≥↔⊗*↓Q%&{$∧α∧4iDααα↓Q$Jε ≡f*ε≤LF."∞≡VO&T ∩ε6↑tπ'⊗≡∞2π&t
FF* h n
(_;LD_9→ \λ≠>$
[xH
<⎇≠n/+C"J
→8<lT→Z;LD_;↑$∞≤Z<∞4≥~_.D≠8>$ Y(∪
≡⎇→9∧
;H≥
(→R-L(∩∩*:∪tV+:n K )0w#!.~_=∧∞y<Y-d⎇λ∃∞ ;\yL↑\Y9∧∞≠h∀hXu0Q+6+∩S(;+Hλ
<9(~,D≡;⎇$ x;H
\:y(∞M→#"N⎇≠{→$∞~~;Lt≠Y8.L<H∃
;H∩$
→9U∧
= @⊂λ$Sv6λ12P$[⊂:7P→wP7{→y⊂4zλ;tz4λ<wzWβEαEβ∧π25-Mar-`d@@`Dfj∪∃5
↓MK?WI∧εfO≡≡Dααα↓Q%&{$∧απ≡ ≡εO⊗tλ↔"¬_→D*α↓Q$Jπ=
w.fDλ
≡Y(→m}λ_X,=h≥≠d∂9y(∞≥{{Y.%Hλ⊗-}(→~,Mβ∪r≠pqrP_P44`4 with GolUb
by p CY-S]NA¬E←kh↓K@↔S&K;≥β⎇+Qβ?2βS↔π≡C';≥p∧α¬& Tπ∂&≥lF∂⊗Dλ
|9λ∩.P7w2H1wry≤βa¬
@AKdAcUCeiKβ⊃β >dλ
(_8l≤α2vtXP8r`\↔⊂⊂ H32{@≠v2⊂ (ands li`↔J↓[@∃β&+π∂!∧¬vvG∀λ
∞⎇c"Sn↑λ≠p∪λ842P≥492`% quarters (buy@%]NA←UhAoSβ#!βK-≠↔πK≤Aβ .⎇lWJJDλλN↑λ∩(∞M~;ZaQ]~→$∂8πp∃Ne` dAα3π∂We#eβπd¬Bπ→88m∧≥~→$∞~≤Y,T≤8
`!pp KeLXACYβ## ?\⎇αε@→8=L↑h_<L]Iyβ!
_8Y∧∞≠h⊂∪Yz⊂3 /p∧ACY5←ghAα ;eβ⊗+πO?pp4(Q)⊗ $≤;u$ <Y(∞≡~;⊂⊗λ4s:2\2yz2Y⊂4w Stanford, Golub can↓` ↔π&K3eβ⊗)βK↔∂≠GWK, 4+SF QβG|εRπεL≥bπ&tλ
t≤∧wj\α share o@_A`∪↔∞≠#'lp D∧⊂∧P 3uppo@MJAiQ¬hA'i¬]M@?⊗ 4+∪L∧f ,<Xh @93v@ the Unive@I`∂'SJβ?2 _
M8π7`)pεAS\αβS#'~β7πS&+A84Ph*S#*βGSW&+;CM∧εv/⊗T ⊗oπ,Z7<9λ⊂≠Zz4⊂)[vrP /d∧AiQ∀AiQSαs⊂∨~∂_ nT~_=LT→≠p↔→P0w2βE;t`4h p∪←U`AS]QKemSα+]1β↔+QβSF+e↓ &{9∂Q∧ε6.(~≠nt≤∧wjH30 t↓S\DX↓EKGCUcBAi!Kr4T∧6}w=_ ↑H⊂λ 2ologa narp¬P∨]∧ε7.⊗,XλnEHλ∩-d≠>(
}~;Z-⎇Kλ⊂~~2|Sy→P6ti]0p e@8ACE←Uh∩+&C'M⊃∧∧⊗v" ∀π>Nβ≠λ <<X↑$∞~→( ,8ε6⊂≠w⊂0y→ztw3H:40zλ67stXP897Yy0vvZw3P$\FE0P≤zq5 %ct fOp which STanfoRd has to @5CWJAI←←Z\A⊃←o∃mKdX↓s←jA
←kYH↓QKY`4⊃ErA5CSIS9JA[J↓BA]←β#∃βπ⊗{WQβF{]βg⎇)βO↔*βS#∃π≠W +,≠Qβ?2β3 >⎇_2ππ-xwε∞β;:-lc"X.∀_(⊂≠Z7v2P_w2⊂$≠{P<w]y⊂;w\5P3$]9P4wλ:7P )t.
λIf you want to phone, I can be reachedat $95-4430 ofFice op 857-067H~∃@#|k∃)↓¬##GK≡#πeβ∞3S↔Kv{?9β∞s⊃β↔4∧VvNlp ∧ ){∪∧ Y(⊂⊃[w9z`,tifg↓C]HA1CoeK9GJ~∃1SmKe5←eJA1CE@?⊗ S/KJβπQ↓!⊃I5A9)a↓∃∧ 3!β∂∪↔¬β≤¬v&*ε@ &U@εEεBβ∧π26-Mar-`d@@@β↓U@0α2S(P⊂εE∃4π: csl.p¬K@' ∧ε∂"λ∧u%ZpstHTλβ"M4¬c - One hh∂aKβ→β#∃?→β@& Tπ>≥9→-nα⊂;t≠P;pyH0r6t]8∧ed8@A)Q∀AP∨ αh
-}<h⊂~≤αa`≥gαcπS?α!P@-<h⊂↔[2P7`& p QJ↓←iQKβ⊃αBJ~β@∨'\LVw≤h⊂⊂]⊂)z0[30∂bd,∧⊂∀!Q `@lMK)\<K ≤ ⊂⊂__L_∧e&Pβ @YSBA&D[α@~))↑t@A≠
~)Ch@@ ↓`∪∪D
v.&lX lL>(⊂~~2P',U⊂;t`2e te@I]KHAβ#=β∨∂∪ π∨*p4(Q `[&eTn∂%P∞ε$λ f⊗B2S(4λβ"JMnHλ∧ |y N]≠≠8-d_=
:+4pizQ#"J|αP6tYt:⊂;Xtz⊂#≠y⊂4jλ:7P!→P9ts[2r⊂1≡P i(⊂P24y→qz7y α
26-Mar-_2 0327 JMC
To: RPG
(if nil 'a 'b) works at SAIL but not atS1.
envy
To: RWG@@@~)∩AQCYJAgkα≠∂π↔&+⊃β'pβ';∪,≠';≥ε β∂πα8 $
yH⊂M≥Y→0→λ2s;<H4s⊂!→z:<P∀qwz: α She
∃o¬]ifAQ↑AW]=nAiQ∀A]C[∀AWLAβ##∃β⊗K;∪↔⊂βπQα∧
J
β∞s⊃βSF)β+πn)β >dλ
(≤→.9wwεB0z⊂(⊂i!P+Z5P1`[⊂:2`,l he@HACE←UhASH8~∀4UβK↔3Nk';π↔IβK↔n C-β∞∪?WQ∧∧ff∂mx N]⊂⊂$_{0 ng flavors May be i`≥I∃aK@;&+;Qβ|∧`hW⎇ W&F↑ λ∞|(_<LT≥_;
tp∞g↓CE@?αX
∧
βq5 %cts Op∧Ac@,∧⊗wε≡M⊗/~βHλ ←(→0≤_vx6 % h∂LAβ3↔∂S|ε'1 X;LD≤{8-M≠Y0→\β re@→KeeKα!βC=∧ε↔.∞nM↔&N↑5`hPβ"@↓AβY≠⊗Spy⊗@82 "β9QL&Tj~α↓Q%&[$∧α∧≤β∃⊂λ⊂⊂εE ~⊂
6 tue@LX ↓]S→CC5bα+ ?,L⊗rβ⊗εαb∧Mx
Dλβpq1_|P6 %cture
~∀_⊂≥I:j7πIhπβ∩α∧"∪ λα2S(P⊂εE∃7]⊂⊂λ εFL
ia`n8bPAC9HAaY∃CgJA5CWJA∧A→Sm∃aP↔∨⊗)β≠}-Rαj∧B∪
@L λ @5wr≥44yP≥4p
e.
~∀_⊂≥I8j7πIhπβ∩α∧∧@→L≤∧e&Pβ
To: MLB@@@~)∩AYS-JAi↑↓ierAα{WQβ&C∃αOL¬V⊗↑M_λnP6pqZ4p∞e when↓G←]mα+;'↔w 4(Q `@lMk)\<K ≤ ⊂⊂→ MZ@e&PP⊂εE∃7]⊂⊂λ!)P0]⊂)jVPdPεEλ∧π27-Mar-`d@@DLff∪%]∞@@∪
QKgQ%eJAE%]IKeL@@@~))↑t@A¬&A¬hA'
5β∩4T~¬i↓αα*6
∧ QαN*jε%hS∂?7*β'9β';=β≠d∧↔6␈.5BεF≥~'Jε≥lBπ≡≥↑εf*d∧¬&FT
ε∞O/∀ε}vT
F∞↑↑4ε⊗NβY→.∧≥_< Q"Xx.≡y=≥ ↑h~3D∞~≤Y,T≥z1∞M≤h_-lλ_⎇.Nh≥~ ](≥≠d∞~→(
L9Y⎇
∧≡;⎇$∞|→8m≤↑+C!*~→(∞≥9<≠ T≠{Y$∞<y0→H892q]z⊂_HHα tapes and cannot Bind Books more than
about 1.∃ timeq the thickness kf JMC's fh CM=`AaCAKef\A¬kh↓ShASL~∃gS5aQKd↓iVA←AKeCi∀XAQCIIKdAβ#=β+∞i1βπv!β#π~β∂?3␈∪↔⊃β& C↔Mr↓α←∃εCπ[∀hS ?SBβ∪3π6{CMβ∂!αBε∀→1↓↓EC↔K?Bβ ?W>CQβSF)β∂?oβπ;erI↓α7JβC#?v(4)!#IQ↓Q#IE%β>K3!β/3↔;S, 33Eπ∪';≥ε Qα3Ns∪¬α>K33'∞kM∨Mπ≠←'S≡C ?π⊗!04+>C'∂!εKEβKN;#Qβv+cAβ&yβ¬βF 'Ke∧≠#↔OFKK∃9αα%βO/≠C↔∂"βG#∃ε≠?W3"βS↔3`h+g?*β¬β3␈!84(hRS#↔⊗)∨Mβ∞cO=β
β7πK6+3?W~βCπC/⊃β+?>;3↔IεK;S=π;#'∂Bβg?Uε≠π9βπ+Qβg␈+H4*&{[↔Iε{WSC/!βCKN{AβSzα∂#↔≡C'K'v91β←FK∂!α∨K7 ?fK∂MαNs
β+/≠Qβ#∞!βS<hS#π[*aβW;&K1βSF+eβ3. K;↔"β'Qβ≡{OQ↓#1AA9αα%βSFK;-βO!∨Mβ↔Iα~6~q↓α∂∞c04+&C∃β7∞K9αc/∪?aβw+7 ↔∩↓!Qe"↓QAAαIβπ;"βπO-ε3?IαV+π;;N)αSK.K∂#↔bβ?H4TSπ;↔"α7?K.cπ;⊃εK9α f#≥↓M∩p4(4P0=IBj7πIiAI↓↓β↓Ud&Tj
↓hRS=iα↓α~~b↓↓↓hR∪'⊃∧IβO↔v!βS#*β3↔S&+Iβ?rα ?g/⊃βπ;"α7??⊗)⎇αCf+πO∃π≠↔;⊃ε β∂?πIβS=∧∪3↔∪≡{∃84Ph(0=IBj7πIkAI↓↓ !UP&Tj
↓hRS=iα↓α~~baα∞2"↓↓↓hR%β#∂3∃β∂F ;∨↔"β7eβε OO←␈∪⊃1β⊗+∂πW≡)α%β&C';-π##∃β}c⊃β?v)β#π~β ↔↔rβWO↔"β eβ∨#Kπ;>+KM8hP4(0 ;'¬Tn∂%P∞ε$λ %&F ∧e&PP⊂εE∃7]⊂⊂λ)+k@λ⊂⊂εE⊃wyx"\α 494 4491, at↓1Ke←`~∀4P0 ;'¬Tn∂%P∞ε$λ &εGα2S(P⊂εE∃7]⊂⊂λ3wyx→y⊂0zλ( i!Kd`l!H⊂⊂εE⊂y2P<[zP4`.tereSted @%\AKCQS]NA1CiKd|@AπC1X@pj\Z`lNβ⊃0⊂H!Q C
To: FFL
Yes, the letter to Bachman.
∂29-Mar-82 1159 JMC
To: warren at SRI-KL
I forgot to ask whether they can be reached on ARPAnet.
∂29-Mar-82 1255 JMC File server
To: REG
1.I think we have sufficient word from ARPA to justify proceeding
on the file server.
2. I talked to Poole today who will call you. He isn't making the
F5 and will propose an F4 but claims it will be cost-effective. He
can have a proposal in about a week.
3. Are there other plausible candidates? Should we get out an RFP?
Perhaps someone should phone D.E.C. to see if they can do better
now than before.
∂29-Mar-82 1949 JMC
To: chandrasekaran at RUTGERS
Unfortunately, I'll be in France May 3-7.
∂30-Mar-82 0100 JMC
To: FFL
geabst[w82,jmc] should be scribed. It is the abstract I'll send to GE for June talk.
∂01-Apr-82 0924 JMC
To: MDD
I'm glad to be a reference, but I'll be going to France on the 10th. If
you tell me to whom the reference should be addressed, I'll do the letter
before I leave, and my secretary can send it when the inquiry arrives.
∂01-Apr-82 1025 JMC
To: ota at S1-A
I can't leave Stanford till 11:30 Friday, because I have a meeting at 10
concerned with using our ARPA computer money. If it turns out you have
to leave early, perhaps I'd better go separately. If I leave at 11:30
from Stanford, I can be at the Lab a few minutes after 12:30 depending
on traffic. Judging by our previous trips, this should get us there
in time for the 7pm ceremonies.